 鲜花( 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)
- M) {2 d6 ]" w4 h7 T) _3 ?' \
# j' k' W8 [( j$ |! H7 `9 ]1 _Proof: 4 ?& F1 A" } E1 f
Let n >1 be an integer
! [! N4 V% }' O; X: qBasis: (n=2)
2 X k5 [5 V% j 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 30 j8 x& ~8 b( W$ ^2 O$ R( m2 }
/ G. m+ ^' f7 Q2 h* s$ CInduction Hypothesis: Let K >=2 be integers, support that1 m3 c! }9 [5 G+ h$ t9 J
K^3 – K can by divided by 3.0 v7 [% V( |0 I8 K" W/ p
& a, O" P8 I1 D; H5 i( Q7 Y
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
: X* U" l" n6 \$ p, [# [3 usince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
q- O! Y( H* w7 m* \- hThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
0 @- v9 x8 _4 L) e = K^3 + 3K^2 + 2K# x% O7 l) ]& l9 O( s8 ?5 z
= ( K^3 – K) + ( 3K^2 + 3K)0 n/ e) \% T# T! Z+ y) u+ U, u: W
= ( K^3 – K) + 3 ( K^2 + K)% G* |$ g' t! [/ e. p% b3 y
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
& E( T3 x& I+ Z t6 L" CSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K) G4 P2 a# g& d
= 3X + 3 ( K^2 + K)/ ]: y7 W0 @; O. j
= 3(X+ K^2 + K) which can be divided by 3
) z" `4 o% I- q0 J3 x" p0 I7 U) `+ b( ?
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
- t% J, o* S- J* N5 }/ q
) _+ _0 |, H1 s# _$ E7 {: B$ J+ ]- ^( C[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|