 鲜花( 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)1 E. S0 {2 G8 {
9 v1 t/ \1 f' KProof: : L! l7 ^% |7 e! U" F
Let n >1 be an integer
, u; O# C) a, z) f' E; LBasis: (n=2)' y9 W* [3 w, r! L2 g$ ^& N: w
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3$ s/ E# E% D8 h: q8 C8 P& C# o
3 O7 n" l1 I# j8 c* a$ v: b
Induction Hypothesis: Let K >=2 be integers, support that7 }! Z; N' V2 `) c! [7 `
K^3 – K can by divided by 3.
$ R6 y( p8 q6 o" d. ~- G3 {& ]1 Q) n" g' l% H5 U0 G& M
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3- a: ^) I' Q9 e; p- ?; d
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem+ x3 l% f6 P. K/ ^3 d, E* u' y+ w1 }
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
+ ^4 j+ a9 G7 t- c = K^3 + 3K^2 + 2K
* t7 {' @" G7 e# r, z2 g4 s = ( K^3 – K) + ( 3K^2 + 3K)5 `: q4 J0 L/ K/ m* n
= ( K^3 – K) + 3 ( K^2 + K)
2 [+ t: H. }, [ l% |$ d) Tby 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, C- z! W' U8 d$ m+ s
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)% q& |4 m' D1 ~* u# u7 p0 ?
= 3X + 3 ( K^2 + K); j* ]8 }5 d: y3 U0 I' ?2 @
= 3(X+ K^2 + K) which can be divided by 3
6 ~/ l& l! c5 c; ? C
0 ^: W. j& j) p3 |/ N1 L# J0 O- LConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.. u7 p1 V5 V: O
8 D3 R6 P8 @- r$ J9 Q4 d
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|