 鲜花( 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)( o2 ]* I0 H7 k' I; R& j
! f+ @% g: U6 C Y5 b9 l, O
Proof: 2 s) |( x/ P4 c9 e
Let n >1 be an integer 4 z/ [9 d( y8 k( k/ Y; F7 [, J
Basis: (n=2)) ~0 p8 @4 ^4 x2 c+ S. D: O: n
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
! X# h F* f" ^$ @# J2 l2 T2 D
+ _: ~+ k0 K+ @& ~- r& h5 a4 \" V* eInduction Hypothesis: Let K >=2 be integers, support that
7 f9 t. W6 x7 ^* A3 j K^3 – K can by divided by 3.
" U l9 ^7 r3 x8 } V! l+ l! N! v, v& C8 _% B
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
5 E- i( {) \$ E9 N- V: k* K. Qsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem# l' E+ E( Z$ {# f% R1 m) ]* X% r
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
; n0 H5 ]7 ~7 o5 ?5 s. e, _6 T = K^3 + 3K^2 + 2K+ \2 n2 q0 ^$ P) \
= ( K^3 – K) + ( 3K^2 + 3K) A. u8 X& b. P; f8 f( i- s: Q4 C
= ( K^3 – K) + 3 ( K^2 + K)& [! _" |* |/ Y
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
& \* G7 S" J$ B- u# ~. CSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K). s, M8 t6 Z) f) i' S7 S f
= 3X + 3 ( K^2 + K): h* D) \5 @ c: }3 x
= 3(X+ K^2 + K) which can be divided by 3
: T& a2 I8 ] B; {+ g* j$ I" c8 `; C% |+ w! ?6 T. B& a5 \
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
2 `$ [8 _( q6 o( e' z& m: Q: h( Q, V; M
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|