 鲜花( 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( m' X% I6 p0 x. j
) K- U+ M9 `9 V) \Proof: 7 p# q1 v4 F8 \' j9 ^
Let n >1 be an integer 9 e. {# S: h2 G. C; m; \
Basis: (n=2)5 O3 o- j! s5 c1 j9 q
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 35 U9 U2 m) h$ p& Y" _
; I5 C( T! i1 ]5 u9 b: c3 Q
Induction Hypothesis: Let K >=2 be integers, support that
8 ?+ n6 M, D1 u, ^5 _ K^3 – K can by divided by 3.: J0 P/ A4 J) Z! ?$ E- O
6 \. H$ P! h, i% t( s! A. M
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
, V1 w. I& l6 d' P0 |4 q: bsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem8 c" l" P1 m q( f0 Y: R2 f
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)& q! f4 o* k' `1 S
= K^3 + 3K^2 + 2K
, d. f' X2 d" K7 K7 V$ y = ( K^3 – K) + ( 3K^2 + 3K)
7 v/ S6 I8 @. k" Q9 _; T = ( K^3 – K) + 3 ( K^2 + K)2 n& k9 z/ W+ n2 ^2 F$ u8 K. R
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' L& w+ X5 x# S- V1 H
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
3 N* W, B+ a; j% l = 3X + 3 ( K^2 + K)
7 y* r, |8 z2 }+ S = 3(X+ K^2 + K) which can be divided by 3( e7 F- P" n1 s5 T* z6 R
4 m$ C3 h: k! r P
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
) v, W# R( ?; B5 V& e) l2 A( W1 ?7 i1 f
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|