 鲜花( 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 d" v% Z8 b6 I
- D& T; m( X" ~- y6 K
Proof: 7 C9 ]1 v0 r" @3 e8 n
Let n >1 be an integer
& [4 q) U) u+ e! A( k' RBasis: (n=2)# w+ l4 Q" |0 G2 c
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 30 o( v3 S& v) y* {; h W2 r! ?# S" Q
! j( x1 R+ Q- ^1 g
Induction Hypothesis: Let K >=2 be integers, support that
$ Y5 E5 L0 q5 V0 B' _) a: t* Q K^3 – K can by divided by 3.' v* [' Y# J+ K. A% W) R/ Y2 b
- v0 Z, q9 z" q: M8 ]5 x5 F4 `
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
7 Z6 } V* j& Y4 e. ^2 hsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
- L! G$ Z) V& r/ c* AThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
" m K6 W9 a5 ?. N( N8 k9 ] = K^3 + 3K^2 + 2K
5 ]% Z: w; H, x- t/ h+ Z! o& G' h- O- J = ( K^3 – K) + ( 3K^2 + 3K)& W4 y6 o9 Z. T' R/ p& o1 w( j! V: Q
= ( K^3 – K) + 3 ( K^2 + K)' {7 \3 F! o% e* }5 v9 V
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
0 Z9 I& V; M4 Z& x6 ~' k' HSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
5 {! `' e( |8 J9 |8 ? = 3X + 3 ( K^2 + K)5 N- P+ [* V# M. g9 ?
= 3(X+ K^2 + K) which can be divided by 3
" \ R4 p' v6 n% o9 V: }6 z) ^! `! P/ p1 t `- c, J% ]
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.- `2 W2 a6 c7 `) @8 A, R
% c! F* a, m o3 p( t[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|