 鲜花( 53)  鸡蛋( 0)
|
This can by done by Induction
Show that for all integers n >1, n^3 - n can be divided by 3. (Note: n^3 stands for n*n*n)
: _1 v" F, \6 M/ ]; d1 X
# T( c |$ r! y5 g( l. h" b$ UProof: $ A, k! a# X' I% w- b, `" p3 x8 M1 y
Let n >1 be an integer
2 d y- o: s( A. |$ j4 R+ FBasis: (n=2)
: _- B9 ^( a0 q 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
1 M+ M$ q( i+ B9 g8 R! O3 k% d5 c, h# P( B" b) n; O
Induction Hypothesis: Let K >=2 be integers, support that
& o4 m8 W; c; G5 M4 a3 L K^3 – K can by divided by 3." L! I8 x5 n) c& m; f
% o. R: a, ^$ {) H) g; Q
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
% M+ R4 O8 [" v; y, C: ?since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
! c6 }& r3 e6 l; a, AThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)! d: l3 |3 x3 ~) h5 d% H! a
= K^3 + 3K^2 + 2K; _0 B) Q9 {3 I' C% ?7 j
= ( K^3 – K) + ( 3K^2 + 3K), V& o- ]4 m) o1 V! O ]
= ( K^3 – K) + 3 ( K^2 + K)/ Z0 T9 _" s7 w9 p$ n0 |" C' J
by Induction Hypothesis, we know that k^3 – k can by divided by 3 which means that k^3 – k = 3 X for some integer X>0" W1 z6 E2 m! \0 R; ]
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)7 d8 {$ N0 G- x6 [ o. o3 D: ^& r
= 3X + 3 ( K^2 + K)
' H1 f3 U& d' _. W/ _ = 3(X+ K^2 + K) which can be divided by 3) r3 i" P7 v. ]4 k- ~
7 ]! n! Y F1 s4 O
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
3 i4 k9 d! Q- g& Q1 ^, H/ k9 e: l
7 S" i5 C. E, z% _: n! f[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|