 鲜花( 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 s0 }! ~, U9 D) q# o- @4 H" P
. O- \( V' ^; a5 BProof: : T8 ?6 J; w- |
Let n >1 be an integer
* U; z6 d0 y3 k3 @4 k/ LBasis: (n=2)* D9 v% |8 M! I+ H) C) \6 Y0 p% u
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
7 p5 i. n/ k5 _+ ~" m! y9 w4 o# M+ p. E: k5 M/ R
Induction Hypothesis: Let K >=2 be integers, support that
6 {+ y( P F' ^ W1 k5 L- o K^3 – K can by divided by 3.# r! E4 t. K% g' |6 k0 O5 f* P
) Y2 p# W. w5 Y1 L4 j0 [' ~Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 32 f( }/ r- S' `" e* v
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
9 s% m- {$ V% @, q6 s" U; wThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1), r$ F: m$ h/ y
= K^3 + 3K^2 + 2K
& w2 H) ]+ Q# }( d) [4 W = ( K^3 – K) + ( 3K^2 + 3K)
. X+ l v% o4 H) P6 l2 ]' a = ( K^3 – K) + 3 ( K^2 + K)9 L' |, f9 @& d0 V$ g* X
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
# C k. D/ C- t6 c( ?So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)* V0 }& n& T W5 ^8 M* P
= 3X + 3 ( K^2 + K)0 [4 G9 g3 Q! s1 m" ~" V- a
= 3(X+ K^2 + K) which can be divided by 3# a7 B0 S S; P \4 z
6 K# H3 b' N6 [2 l0 n3 B
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
/ `/ X9 P% M+ J3 g+ v" f4 w- I0 _) }# h& L$ B+ T' X5 Q }
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|