 鲜花( 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)
( K) R, v' R) e6 t9 w% Z. e8 o4 ^
% X" F( l e4 r- G4 V' e9 RProof:
8 U/ u9 [; F5 p1 NLet n >1 be an integer O4 r, P8 G: m$ \
Basis: (n=2)
1 I. L+ e5 a* B2 q6 N' Q1 V 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3$ ~2 M8 f* N+ Q0 D1 j7 P: m# ~
9 u9 ?/ n" E6 e, f2 _9 H; H! d
Induction Hypothesis: Let K >=2 be integers, support that) C: q( G6 q: A- {+ z* A
K^3 – K can by divided by 3.
5 Y1 z3 D8 a. f, P. [7 T1 R2 @& m0 f5 B! c9 J* d( y
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
9 |: m* C7 I5 _$ W2 t! w! tsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem. u- ?& u& c+ U
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
7 ]/ I( x% x6 G8 K. D = K^3 + 3K^2 + 2K
$ ~' t7 I9 A( E6 H5 e, I = ( K^3 – K) + ( 3K^2 + 3K)' \) Y0 X2 B) {8 b5 d
= ( K^3 – K) + 3 ( K^2 + K)
% B6 f& l! [( x9 H' q( wby 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: k; v2 F, [- m# @
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
$ ^4 \$ x7 W& M' m/ {) G = 3X + 3 ( K^2 + K)
* P1 W$ y* Z) p9 k/ \7 F0 x = 3(X+ K^2 + K) which can be divided by 3- S1 X5 x4 z* ^" q
+ u; @2 p7 C$ f/ QConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
1 i. R7 p p7 V( G) Q, j
6 Q2 h9 B& {4 |[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|