 鲜花( 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)
: { A+ z* r& U2 p" t( _& |4 I0 i- \- D. y" {" u" k. w
Proof:
9 ?% k( P6 i3 h/ e2 J- C# _# u" GLet n >1 be an integer 2 G0 \) j2 [$ Q$ X$ x7 m& [( `* d
Basis: (n=2)
9 ~% R& G0 p9 U: J 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
7 C2 t& v9 ^% H. q8 P/ Y2 X# b' T! U
Induction Hypothesis: Let K >=2 be integers, support that
$ h9 F( B5 Q/ y$ n# C7 f: D3 d* t2 c } K^3 – K can by divided by 3.
) q( F) R2 @7 t- y2 ]6 X5 W$ L% ^9 y9 A: H8 F0 X
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 30 T/ t# `3 r1 C0 u" x. A. e
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
! O& e2 o1 d6 X1 FThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
1 ?7 f! L$ G2 i9 |) G0 S = K^3 + 3K^2 + 2K$ i8 _" M$ V% ~2 g1 C
= ( K^3 – K) + ( 3K^2 + 3K)6 G! l$ w( z- B0 Z- p6 O: W
= ( K^3 – K) + 3 ( K^2 + K)9 }! _* |) p5 t4 h
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
% m# F' T, J6 }8 gSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
W( Z- x9 z9 H' r' j$ W% I n6 _ = 3X + 3 ( K^2 + K)
! d4 y# w9 [, r5 a = 3(X+ K^2 + K) which can be divided by 35 {2 j% B" x# y2 |+ F! S2 t& C
1 c4 }( y9 s# q+ O# ZConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.% }" ^& l5 y/ |1 C, b1 f
- v' L, w/ Y8 f: t[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|