 鲜花( 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) S" ^4 ~# y* j0 @& b0 o
& j5 w3 b* a. Z7 PProof: 2 M; O7 [* N+ G. e! ^
Let n >1 be an integer : E1 g4 T9 b/ I5 h5 N
Basis: (n=2)
& r; z8 K H2 P) b& F$ N9 c; v 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
1 i( Z, P& f, A# G' T$ J2 N& z: }+ d' |$ _1 t! b
Induction Hypothesis: Let K >=2 be integers, support that
5 x" `/ q( W0 |6 y K^3 – K can by divided by 3.
" a" e& x7 x: ~3 V: P: v1 w! o( P1 K% ^3 S
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3; z, B( q# a& w
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem6 ^& a$ m \. Z
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
4 ]0 e. e8 g$ K5 \ = K^3 + 3K^2 + 2K
" b/ m4 K' ^+ t" F1 b/ M = ( K^3 – K) + ( 3K^2 + 3K)
+ G* M; X+ j$ e( A" m = ( K^3 – K) + 3 ( K^2 + K)# t) b, @- 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
3 w" d5 W- e0 _# ^2 M: rSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)' i) X' Z- ]. l: A; S* d$ i: T
= 3X + 3 ( K^2 + K)
! B" X/ {" P) p2 a) j = 3(X+ K^2 + K) which can be divided by 3
2 R7 U# C- O7 Z4 Z9 r* i5 H" }! m
9 {1 p7 @3 G( P2 w! H. u, jConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.. C/ a3 P! k5 H$ [
7 D- u4 f( n( K5 S q) t5 `[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|