 鲜花( 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)
# j8 S( u3 t* ^- ~6 R; X
) M' @. n: B) b/ cProof:
) d3 P7 i3 A. M: X3 i0 X8 {$ E1 }Let n >1 be an integer 1 m' k/ ~& d) H" T2 f$ x
Basis: (n=2)
/ Q, Z: ~$ Y7 R& P9 ` c. \ 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 32 J% U3 D* H; Z. N5 r- d+ y( d$ f
1 ?! h$ m; s' ]8 @$ K' e/ }
Induction Hypothesis: Let K >=2 be integers, support that4 T# [! y' Z; d. A! u* Q( N, }7 K# b5 Z
K^3 – K can by divided by 3.' w$ o; b" q: o: i8 L6 {+ R7 j
$ T) q$ x1 x Q0 KNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
$ d( ?1 b: {5 vsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem% X& U1 k# L0 z. R3 a
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)! ~4 S6 M( C# t: d3 `# Q6 B
= K^3 + 3K^2 + 2K
, h% y3 ~' i" t! Q = ( K^3 – K) + ( 3K^2 + 3K)' i% q+ t8 B b1 M
= ( K^3 – K) + 3 ( K^2 + K)+ r" {! b. q+ q& `8 h
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% A$ _* F: | Q8 t) k( q
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K): y2 C$ v" C g& v6 E0 [
= 3X + 3 ( K^2 + K)/ c3 F4 B, w& k
= 3(X+ K^2 + K) which can be divided by 3
d& I+ i' _: B0 O, o0 e8 l4 r" R4 ^ c1 A. }
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.2 l/ \5 U5 a# ^
4 d8 H/ l9 H6 ?
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|