 鲜花( 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)+ ~8 @$ p8 f2 i# P0 s5 c
: y' l4 G0 h' Y5 A" ]. Q
Proof: # S1 J/ I. J2 O- w4 X
Let n >1 be an integer . v7 e) L/ H- c" G U
Basis: (n=2)4 B; C7 |& Z+ v& C% l
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3" f6 F3 ^5 q4 L
$ v9 s6 T( Y1 N5 U" Z1 B3 m$ UInduction Hypothesis: Let K >=2 be integers, support that5 f! J5 f: c, `7 W" i7 X7 X
K^3 – K can by divided by 3.$ J- E1 ]' o @1 x; o
o$ {/ w8 V1 ^; @8 j' h7 Y, o4 VNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
. j+ o8 B# n- n0 H7 U6 Ssince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem# e8 B+ M0 [/ {+ a* P! _
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1): w/ r/ Y$ Y L
= K^3 + 3K^2 + 2K3 Q) Y: v6 z3 A$ C/ i' H3 a, c6 o
= ( K^3 – K) + ( 3K^2 + 3K)* H; M; c/ ~3 H; ]' a' N2 Y+ I
= ( K^3 – K) + 3 ( K^2 + K)3 O6 M P3 X# \7 r2 W' i
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>07 V% }: z0 Q' \0 ^* G# v' {
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K); X+ v: b; P; V0 F9 n! u9 n
= 3X + 3 ( K^2 + K)
( G8 K( m0 }/ a/ i" h; a" X = 3(X+ K^2 + K) which can be divided by 3
7 s. B3 @/ G& H# N+ m6 ~% L5 U" d9 L/ p+ g% C& Q$ A9 E
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.1 M% x& G6 s: R. }# ]
- W! b$ m* o1 c1 z: k[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|