 鲜花( 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)
8 U" r3 n3 `0 o3 p
: u5 _% L8 l7 B7 ?Proof:
+ Z' Z+ G- |# v$ k% C7 eLet n >1 be an integer
/ @: S9 h1 A- ]Basis: (n=2)
- R+ v. z% ^- ^" z0 e 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3 \% c; \1 ~$ J$ l1 B8 b7 E4 G
5 l% Y6 X: t% c8 l2 jInduction Hypothesis: Let K >=2 be integers, support that! y% I4 h ~' L! c$ t
K^3 – K can by divided by 3.
' c7 m6 P+ v4 o2 L3 ~/ V4 b& q+ l, U9 n* e
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3; L& z6 x' a, k9 ^& D
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
- e+ u6 i; l4 P, tThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1). r7 a3 L. e: b' r0 D
= K^3 + 3K^2 + 2K
b. w6 w" [0 q) I X% i7 N1 O = ( K^3 – K) + ( 3K^2 + 3K)4 X4 m* l( w+ k) P
= ( K^3 – K) + 3 ( K^2 + K)) ~0 r! e# j: }7 W; _
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
7 ]( K0 c$ g" m. m6 z$ r! XSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
2 y* s. `& E" ]* ] = 3X + 3 ( K^2 + K)
0 X/ s: Y8 h5 |0 P = 3(X+ K^2 + K) which can be divided by 3
# D- m* W3 A3 l* ]! e# u3 f3 f( a
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.# h. S# E/ a- L p9 L
* Z3 w1 ?5 f/ d9 t# N[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|