 鲜花( 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)9 u0 M1 f G! a& I/ y
( [* |: d! z1 [7 c* B R
Proof:
& S l w" z4 x5 U" L; T/ ?Let n >1 be an integer * J* ~. x* F/ W7 ~
Basis: (n=2)
9 Q8 l4 l. @& |+ m! X" y( V. H 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3* ]8 Y3 [$ H. s. ?, M
- n- ]' Q, q- b9 z. _9 Y
Induction Hypothesis: Let K >=2 be integers, support that! o9 M3 T; ^6 t7 G. J1 h
K^3 – K can by divided by 3.
; h" K3 R: B% u$ T" H/ q& t+ E7 [0 g3 u& E, a4 ?
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
8 m% W. J" b- ~6 t% f2 R. m8 rsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem7 M: a. a; D" I) o! e2 ]" X# u
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)2 a3 {# z! u* k; o6 r
= K^3 + 3K^2 + 2K
: }1 x1 v5 n5 F; j9 a, s+ D- d' G = ( K^3 – K) + ( 3K^2 + 3K)1 K1 y1 x6 p9 C3 L* C
= ( K^3 – K) + 3 ( K^2 + K)
) a9 b& ^4 A+ Z5 e% Eby 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; ?. r8 R& k' b T$ R. a2 A! V6 k
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
2 V0 F7 T/ h, s% T9 v' r* j = 3X + 3 ( K^2 + K)- D R. g0 `5 A) B5 R2 E
= 3(X+ K^2 + K) which can be divided by 3! N( s* _* H& x$ k
( ^' @% X Z0 W* ^* aConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
2 O6 j/ P, b2 l$ {
9 R2 e) J* q; W2 ?[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|