 鲜花( 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)" t# F& L' P5 j# ` q
2 I% n' M* ]6 |' PProof: 6 {, [$ D% M9 ^ l" d2 `+ Z
Let n >1 be an integer # E- P, ?4 Q- d( i' q# Y; n
Basis: (n=2)2 p: p6 ~' i, j+ ~/ W
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
z/ ~0 q3 s+ p6 i+ P: o
9 J/ t% i4 ^) [. y. p) v/ h- EInduction Hypothesis: Let K >=2 be integers, support that
) A; j w% k! n$ Y; ?2 x7 c( U K^3 – K can by divided by 3.
; H: S' z, q% `
' u. N. o2 A6 L+ F& w3 vNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
3 _7 j9 V9 Z0 P/ W9 Q) X# j+ Vsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem3 r9 G8 g( o' E, a/ L
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1); M/ |5 L8 @1 k1 Y6 y5 }9 M) C. J
= K^3 + 3K^2 + 2K
5 b% _1 g( o; m6 |* C8 o/ ^3 F# [1 ? = ( K^3 – K) + ( 3K^2 + 3K)9 n; O! c+ q5 W7 h. n
= ( K^3 – K) + 3 ( K^2 + K)
8 J* u5 F F' J" r9 gby 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>02 u. V9 ^1 \" d& @, i
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)) l u" v& z4 P8 U8 Y6 X
= 3X + 3 ( K^2 + K)
) m' O, T. p& k. I0 D = 3(X+ K^2 + K) which can be divided by 38 [) a/ O' r& k$ L
3 G/ }/ X. z1 X' o4 D/ J2 D
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
+ D* ^, P' p3 Q; k/ H! N0 P |( X& A. _3 O+ I& q9 n0 z7 C/ @
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|