 鲜花( 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)6 u- \" B! B2 c! h3 c; }
( O: Z! X$ j( A" l) BProof: 0 q% p2 u; |1 T
Let n >1 be an integer ' q2 W: _0 S) A& s1 p" S
Basis: (n=2)
" A* K/ A, u7 x0 Z- y# J 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
- |% o. z' f( }& n! M
* [9 V# G! E7 J- ]2 U; G- FInduction Hypothesis: Let K >=2 be integers, support that
4 _, J+ B' L( y! f/ R+ f K^3 – K can by divided by 3.2 z: Y) ^ {/ n G- y
$ Y) |0 j# `1 m2 ]) i3 M' f# l+ VNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
: c* M2 Q* }, i7 C' q% J/ L6 fsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
) ^' H" G) z1 `/ RThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)% H4 \8 }# @7 U% B+ o/ L: @$ X8 ?+ x9 K
= K^3 + 3K^2 + 2K: G" A& F) E3 p8 @# u+ B
= ( K^3 – K) + ( 3K^2 + 3K)' E. t7 m5 ]9 ^
= ( K^3 – K) + 3 ( K^2 + K)! e5 E) U0 c1 Y F$ f4 J
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/ o; F2 f6 u8 x# z4 r
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
2 d; r( ~ i# i, l: k! j( X = 3X + 3 ( K^2 + K)
- }. Q" `4 ^0 s( y4 N* x = 3(X+ K^2 + K) which can be divided by 3+ N8 _) ^$ W3 q3 ] V
* b) c$ x1 \6 O4 o8 ~ A9 ~
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
; m* ~ E( T' A i
; f3 ~9 T$ b2 S+ X8 u/ K! t[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|