 鲜花( 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)
3 g; s! b) X2 @7 e
' F& E2 ~. a9 s2 V+ I; dProof: 3 {3 F* T+ V8 J6 I2 g5 r0 D
Let n >1 be an integer 6 z( w; L8 X8 H) E3 u
Basis: (n=2)) l; |: |6 |" ]5 d' I
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
' P/ Z/ j3 h w' f/ i2 H' k# g# D$ e0 w7 n5 R9 ~
Induction Hypothesis: Let K >=2 be integers, support that' C. A! }$ J% _0 s0 a8 ^
K^3 – K can by divided by 3.: p# f$ A) Z. c- L7 g% b
+ g0 v; {2 }( o; B0 i/ I
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
7 p. H3 M" d- ]2 p; B/ E" [$ f ?' ^since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem% u+ o: O- Y+ e- h) i
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
5 r" q) `7 e/ E( e. l* ^* Z = K^3 + 3K^2 + 2K( n4 j- U5 ^% u
= ( K^3 – K) + ( 3K^2 + 3K)
. Q" F0 h1 y& |% z. v9 D1 F6 F = ( K^3 – K) + 3 ( K^2 + K)6 e/ t5 t0 p0 i+ T7 R4 e, Z9 W) W
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( K* ?4 u' O3 {
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
% t/ P% c* \5 T) W/ U' O = 3X + 3 ( K^2 + K)' u. b" O3 @) M! B5 D _- B) ]
= 3(X+ K^2 + K) which can be divided by 3
( P8 ]7 @! n( d) `
( `" W, \$ F. AConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
N' R2 }( A$ M% ^+ K T7 c* @+ t, h$ K( P% ]6 L3 v! [: P
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|