 鲜花( 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)
* M1 Y: w$ k1 x) Q; k! J
4 X6 _1 X/ t0 b+ V' f- N4 P" LProof: - r, P% ~: d( m/ V( o+ m
Let n >1 be an integer 0 K% Y5 g$ ]1 U' |1 u( ^9 j
Basis: (n=2)" U* K* _' B$ v9 T N
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3: U# G7 F8 b. [4 Q- v
! @* t6 w: t$ N1 g4 q9 @: m
Induction Hypothesis: Let K >=2 be integers, support that" U* Q, X9 x0 X% \; I
K^3 – K can by divided by 3.
6 b2 [; l4 n9 q3 i) h* A3 }0 l- z7 v, M% {+ ]
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
; J4 j- o# P0 s. v) Xsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
6 p7 m6 d9 h( B) p0 o( b; h; GThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
- G2 p6 Y2 \# d" y& {. Q. e# r = K^3 + 3K^2 + 2K3 t8 ~7 A$ ^) Y3 t: K0 y0 D
= ( K^3 – K) + ( 3K^2 + 3K)
/ G# D* T* X; d0 e4 E = ( K^3 – K) + 3 ( K^2 + K)
& d7 M, i0 Y$ W. @% u7 i* F. \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
4 u& f. z1 D8 ?So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
# Q, a6 b5 J6 l0 p" ?. T = 3X + 3 ( K^2 + K)
4 C9 Z- l5 m! j+ a' j m% ?9 L = 3(X+ K^2 + K) which can be divided by 3# e& Z; a- R7 g
3 [' r5 s1 C3 }3 p" \) y" S6 _Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
+ g) W5 h0 b4 h9 |4 Y3 V6 G' z4 \+ N
0 d* j$ r1 _# F[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|