 鲜花( 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)
4 R: J$ L: e) d1 v% C! V" O% M- j; O" B+ s; t* z
Proof:
) v# W+ ]/ O/ f6 n! NLet n >1 be an integer 2 V& U6 e! q6 z V9 r; z1 O
Basis: (n=2)( R h8 P3 B5 R1 B
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
" }/ ^: O3 p% O# {
4 x, B) E X! S7 D5 z. ]Induction Hypothesis: Let K >=2 be integers, support that
* f' q/ B1 g! O3 C: }, F K^3 – K can by divided by 3.
, E9 m3 Q8 g9 Y, y) V2 X9 ]
/ g: w/ _# o% |0 d- K& YNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
" e; j( C" W1 @0 D" ^) _" o% s' v6 z: @since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
) B1 O' i4 h7 o% t; {1 ~% D0 GThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
0 z6 h! W) k% S' T' k+ @ = K^3 + 3K^2 + 2K. V- e3 H5 J1 P6 h
= ( K^3 – K) + ( 3K^2 + 3K)
, f2 o$ y4 a' [; K3 I = ( K^3 – K) + 3 ( K^2 + K)
' o+ J. t; K2 @+ B1 Q9 ?5 S( yby 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 B# K6 g- q4 ]$ b
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
O4 |; f; s4 s1 U% x/ x! _4 P V = 3X + 3 ( K^2 + K)9 G9 m- t; T& E/ l
= 3(X+ K^2 + K) which can be divided by 3
0 R! D: U( W, @6 _$ ~ z. Z! A" ~% m% b
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
- e5 o2 b f: L1 Z) m3 ` |* z0 l
- z$ C+ g- D3 A5 K# I6 Y[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|