 鲜花( 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)
. }$ k3 a. ^7 {% r/ k5 N$ |! `7 y |/ I; h% d n4 D2 T! ?9 w
Proof: : C8 ]$ M# b, `4 W: `" f
Let n >1 be an integer
) f- ]8 c; h$ ] [3 wBasis: (n=2)/ r! k/ ], D' F; }! Z9 p2 v
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
& d I* V& `' ~8 q! i5 T- w( V% _) ?, V: _
Induction Hypothesis: Let K >=2 be integers, support that
% r1 g+ m4 n+ q" f5 \- D K^3 – K can by divided by 3.$ z) ^; m8 q5 L5 `/ X, V8 a2 e
+ G, F1 o8 |8 i* \7 l. O6 c+ {
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3+ k* h) l4 T+ c# R/ K% r% I& p5 E
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem& a: m4 P; Q# o1 X0 G
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
% {2 v8 w$ ?5 s* E& \' q = K^3 + 3K^2 + 2K
8 p9 h; Q" h8 Q$ N0 x) R- y Y& Z& n3 D = ( K^3 – K) + ( 3K^2 + 3K)# A6 \9 E8 t6 w6 H+ ] ^9 i
= ( K^3 – K) + 3 ( K^2 + K)
! o9 F6 |3 w/ M; iby 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
, L' a; V5 X$ l A- J; @% ?+ vSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)4 `8 l" w% W9 c- V6 e1 k: w' ]
= 3X + 3 ( K^2 + K)' z; v3 L2 J8 u% {2 U
= 3(X+ K^2 + K) which can be divided by 3
2 b7 E& ~3 K4 C3 H) Q) V% s: G# T U3 D4 s4 t0 I
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.4 D) q# e2 Q# ~4 c4 Q7 c, N! |
' m5 s3 O* v2 z X' d6 H: [& Y" a
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|