 鲜花( 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* H0 W( m5 O) X! E6 Z- s
$ k- r3 ?3 S I, j9 _5 F4 W" kProof: ; r9 q5 S* n) z. `1 ~- W: Q& z( V
Let n >1 be an integer - e& S- C' t9 J, ~
Basis: (n=2)5 _+ ?/ g1 e; `( V" A- I
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3 h( D1 ?- C1 e- j
, l1 e3 r" b* y/ p4 t$ M& q0 I; L+ n
Induction Hypothesis: Let K >=2 be integers, support that
4 t _' u0 b' g7 Y. }) j1 Z K^3 – K can by divided by 3.
3 l2 b# |$ j7 V( |) F9 U7 V3 ~' I. I$ _ J0 j; U' Y8 f4 p" C7 ?
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
. K' v/ s! o7 G' Rsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem, F! f" y5 b+ f5 J: S# X" R
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
3 b; X' ?0 Y% W0 G% i = K^3 + 3K^2 + 2K
! d7 _- r' L) G9 k7 }6 w = ( K^3 – K) + ( 3K^2 + 3K)
% V0 A9 z* W2 Q; ^8 x = ( K^3 – K) + 3 ( K^2 + K)
; {3 V. @* Y5 q1 t* Y; 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>02 k( K' K* c' h; O4 B/ T. m- P
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
' c, J4 Y5 I8 K5 Z) `* o( k" o = 3X + 3 ( K^2 + K)( }! z, h% d$ n2 u, C+ s$ R
= 3(X+ K^2 + K) which can be divided by 3
( z4 o& y4 `) H( k: a+ V# ~& |3 o7 w7 D1 ~0 |, x" j
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.' K" e! Z# z3 H; O" z
7 C7 M3 h2 ^8 C! L7 ~1 \[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|