 鲜花( 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)% k9 A1 N. ~ W- m" v
1 w8 a+ H) h6 M" D% n& s: o( q/ TProof:
`5 k) q% @% z9 Z" NLet n >1 be an integer * M w( i! c8 s- p! U3 {- H; q5 x
Basis: (n=2)0 r; J8 a) [. H1 U+ n" M8 V
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 31 i, c: d4 Y! X: z/ H1 y0 S% G
2 z: F7 i: A5 r9 [7 S
Induction Hypothesis: Let K >=2 be integers, support that6 |& g) S4 |/ t# b
K^3 – K can by divided by 3.
) w. v$ h& L. I2 R6 I/ L
) K' R% E" w4 R# v. M# }2 gNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
* k( H: C ^; C: a+ j# Nsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
, C1 Q o8 Y7 S: TThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)! `$ s$ T$ `3 u" ~5 E. K3 C
= K^3 + 3K^2 + 2K
- C# E% ` w3 e' u = ( K^3 – K) + ( 3K^2 + 3K)8 T! i5 `6 e% |) B: |, Y4 g
= ( K^3 – K) + 3 ( K^2 + K)6 I1 j9 |% R' Z& \
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>03 A! X* e' m& T- Q
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
4 k2 r7 F" j- S9 Z7 e = 3X + 3 ( K^2 + K)
9 F$ l8 ? T7 _5 s9 S = 3(X+ K^2 + K) which can be divided by 3" c f1 q/ J* _% x3 O9 y
* ^. b8 @7 g7 B2 dConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
5 q. m$ r. F# i
3 [. [- o7 k7 A6 |7 Y% D[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|