 鲜花( 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)% Y$ f" Q+ \; f" E9 N" a7 {
4 t& u- M- Q) y0 t8 i+ B( B- O- w* ?1 l
Proof:
- q( X1 k4 P5 {( a/ a ?0 FLet n >1 be an integer
1 l0 W8 E0 ~; Q( C0 VBasis: (n=2)
1 {6 f0 g; @& [( ^" ]4 [ 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
# t# O$ {/ i' d! d) L$ |6 T
. p t2 G! j& V2 q6 k6 {Induction Hypothesis: Let K >=2 be integers, support that
- ]6 s) Y: E3 I' `$ E K^3 – K can by divided by 3.
* Q! g: s, r# K0 f- @- h5 q
; u' ~, J, x P& B8 u$ W# z+ k' wNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
( d8 m( n, R2 \, V; s" b( bsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem4 w) |) G! Q+ r' H+ F
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)/ J! W6 h9 ~ z5 B" M, k
= K^3 + 3K^2 + 2K
/ ~. @0 m; m5 H1 N/ a = ( K^3 – K) + ( 3K^2 + 3K)
& E. Q$ e. U. Z& A = ( K^3 – K) + 3 ( K^2 + K)& V" C8 x. m2 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( W" C2 [3 r Y
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)' b4 }0 M/ |% J: T9 j8 Y
= 3X + 3 ( K^2 + K)% z& P3 C: ]) A% c
= 3(X+ K^2 + K) which can be divided by 3
- V! U6 M! H0 I) j
) l6 d& i( I1 u4 F" t2 ^Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
5 p/ v0 k! Y, j$ l( Z: F, i7 J% Z2 \5 \" x+ X6 u7 K- y
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|