 鲜花( 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)( s' n6 J! G' I2 `9 P! K1 T
5 a8 t5 {4 q6 J2 ^' z6 N% W) T6 a. OProof: 3 F* M! f! \( `6 j
Let n >1 be an integer 5 G _! e! r' x( U
Basis: (n=2)
) r- A+ I8 ?; @; g6 n2 e9 @, d( a 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
" d z% C7 [; P) f' \$ I% H1 `4 [$ c$ `+ T/ Z) i4 M( W9 e7 s
Induction Hypothesis: Let K >=2 be integers, support that7 H2 ]* U) j# r% [9 y7 S: Y1 Q! a
K^3 – K can by divided by 3.
( W) Y, e2 D* e9 h7 l9 W9 D4 o! z8 {9 } j4 z' z$ f$ n: V5 i; [( o2 o* y
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
0 s F; y8 m7 Csince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
! M3 Y9 J ?7 \/ |( B- ZThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
v% z/ ]1 B$ |. \% N3 o5 k = K^3 + 3K^2 + 2K/ E/ u0 U5 c! t; {, I2 O
= ( K^3 – K) + ( 3K^2 + 3K)
& Z$ F7 t; M/ d9 T- R. L4 | = ( K^3 – K) + 3 ( K^2 + K)6 ~& U% ]2 y# k
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>08 ~2 O+ U, X" b$ Q
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)8 E; k1 g v! C3 t- g }
= 3X + 3 ( K^2 + K)
+ `# d6 d- o/ p! X = 3(X+ K^2 + K) which can be divided by 39 S8 ^# K: o5 m, \$ c1 b9 G( i2 p
6 \9 d5 ]9 ^( e, T9 n, u H9 J8 f$ K
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
6 r8 _' ~; S! j8 [2 f1 E# A+ A0 q% s- S0 F, l
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|