 鲜花( 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)" V4 e E) J% ^& I L
7 c* C3 o8 t3 ~ x3 x7 m" B0 Z
Proof:
0 D7 `: e- Y, d! i0 o+ OLet n >1 be an integer
# {, d C3 C& S0 r2 PBasis: (n=2)! \* V3 }% F8 y8 d
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3) |6 p7 J5 W0 f: O& Y0 d
5 I1 m8 y' E8 N; j9 R8 oInduction Hypothesis: Let K >=2 be integers, support that
) J0 v1 {- J- R4 \8 i4 w K^3 – K can by divided by 3.% E( w% V3 ~* C& ]4 `! t8 m1 R" \
" K: h( m. D* P( s% F: i8 A
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3$ w. X4 p, A+ A1 F8 K. \
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem5 m$ i9 m/ o& j- I+ c0 a, c( Z
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1), G3 }. M" V& l; N# ~7 g3 V
= K^3 + 3K^2 + 2K
3 I5 J2 t$ t; Y6 e5 z: o = ( K^3 – K) + ( 3K^2 + 3K)
& C5 F, b( I" t7 ~: u/ U+ I = ( K^3 – K) + 3 ( K^2 + K)
; _, Q! a9 N- a; fby 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
9 j3 ~0 m( B, G" j+ i( ~. d) N9 ESo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
8 t- \9 m# w* |( O2 b7 A9 @ = 3X + 3 ( K^2 + K)
7 f2 W& a3 e9 y/ D+ \4 A5 } = 3(X+ K^2 + K) which can be divided by 3" h. n* ?7 }$ L, | M
" j4 o$ h+ t0 l- L3 y% N" U# o
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
4 m- z! |" d1 y( f; Q4 P2 a4 h
1 M* h# ?" n1 S O6 c0 G[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|