 鲜花( 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)- O" [9 D: n0 V% }
# p' h- N6 q, C9 z ^0 D* a5 C8 xProof: - }7 t, j3 X/ _& w% b
Let n >1 be an integer ! Y: y4 S$ e4 o' z* Y5 I
Basis: (n=2)7 N$ w3 k! r u0 g4 m9 L6 p
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
) L* o+ r; J% s& @3 i- T: K" p' z! q D
Induction Hypothesis: Let K >=2 be integers, support that
$ R) v2 T Z9 t K^3 – K can by divided by 3.
/ M3 M- r! a7 m& f( T9 d
* n; ~4 e+ \& y( L* W* Z& g8 I# WNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
6 v8 g. \5 r8 R1 v( r9 T8 ^3 Ssince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem+ f5 Y8 w8 x9 s+ K* x& j/ Y; W
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
8 h; u: K" u! F9 R4 B) W = K^3 + 3K^2 + 2K
, v7 ~: J4 j0 F: m, W0 w) N- P = ( K^3 – K) + ( 3K^2 + 3K). w& w$ S/ k, B* V' }
= ( K^3 – K) + 3 ( K^2 + K). j1 m1 Z1 B2 M, @9 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+ _+ @0 Z \# x* I
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)8 U3 X; r6 L) l- x
= 3X + 3 ( K^2 + K)
: d1 l, B9 d+ o6 M# v. `0 V6 c = 3(X+ K^2 + K) which can be divided by 3
4 U8 e, h2 l5 w( C! e t+ O, |. h& O# I% x
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.: J+ Q" l: L6 j4 S7 u9 {) z+ _, g$ A5 u
# e2 X* b- b0 D, a
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|