 鲜花( 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)3 _0 e" V. k, g5 P: C
! y0 n( `" v3 z+ k
Proof:
8 t. F- k$ B6 r7 VLet n >1 be an integer 5 x! B e: t) z$ Q! C. S
Basis: (n=2)- `* O9 Z6 R* ]7 B& G
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
) i3 }& q# ^% R8 E, F Q1 N$ t. N- u1 M
! G' V$ d3 m U) i, N* I* mInduction Hypothesis: Let K >=2 be integers, support that+ v1 p$ m' X3 e) R9 o& P5 t
K^3 – K can by divided by 3.$ @# C! q9 R3 K/ a$ B4 B5 Q
6 C* C: |* O1 P7 P( k+ [ h
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 39 y+ O+ {, Z& ]6 o, X
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem# h4 i i+ }0 f$ O8 g
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
% @& P/ B& J3 p$ q# B = K^3 + 3K^2 + 2K: c; z; X+ z5 `" m8 `/ k; B1 X0 ~
= ( K^3 – K) + ( 3K^2 + 3K) L3 u8 P1 f9 Y/ B4 \5 E x4 `
= ( K^3 – K) + 3 ( K^2 + K)4 z2 Q6 p. T" x7 V+ F
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" u- G6 b2 W+ i' e9 R6 `( W) e
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
& _$ L1 V) q9 g = 3X + 3 ( K^2 + K)
: }' M1 S7 P7 f! ]+ {% u2 \ = 3(X+ K^2 + K) which can be divided by 3' L+ L P! B; X2 P) ^( d
7 w- S/ ^* |% k6 v3 A* A% V
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
) `8 W* \7 s" R
% ~/ s% \" g% ~1 ^7 i2 C[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|