 鲜花( 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)
* Y) u: X! n6 d3 [' }3 j6 t7 e" Q
, [ _8 m5 V, ]7 f* [3 C% @1 l KProof: 7 `* N# o" T7 [6 H
Let n >1 be an integer m! w- e' ?& D$ E4 V
Basis: (n=2)
0 M6 I% I3 v0 Q$ P \1 C 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3. A( v' Q$ W; N+ J$ ], C& j
( F3 n+ c) _7 n. M) gInduction Hypothesis: Let K >=2 be integers, support that* [# i& W7 F. [; k, Y% o
K^3 – K can by divided by 3.
- e! o+ v4 p9 {! S0 j/ w- G$ j& o3 R' Y* ]. x( V# v9 @9 k
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 39 y2 r/ |- ~! @- P! j6 M
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem2 {6 b2 G$ p, z* Q; e/ I) L7 k
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
7 ~- p- [1 A3 n- H4 D2 f; Q% J = K^3 + 3K^2 + 2K
- ^. p4 R3 A0 ]1 Q! y) A( i5 c4 X = ( K^3 – K) + ( 3K^2 + 3K)/ ]6 a1 G9 g* l0 h$ v
= ( K^3 – K) + 3 ( K^2 + K)2 U% x# z( }8 A% l0 d8 [3 |
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# p. W3 ~/ N; ?) p- E( h
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
, b. \/ b. ~0 [) C @7 F = 3X + 3 ( K^2 + K)2 q7 f$ o4 B) y- B/ P
= 3(X+ K^2 + K) which can be divided by 3
' b+ j# j2 z. d2 p( R+ E# B) l+ z2 z: h
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
2 o' f+ A0 E. i6 H& |+ B/ E. m/ I
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|