 鲜花( 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 A; n# L, j- U0 t4 }3 u+ h/ h$ m2 X) I0 k3 D5 n0 |/ J% V" J% O* C
Proof: \, W5 v9 b. O6 ~. p
Let n >1 be an integer 7 g% O6 I: {6 o. }& u$ K4 M
Basis: (n=2)! I/ T- @! C' q; H
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
( `& R2 \4 {( U6 ]0 @, t: u( s) Y6 y0 ~
$ w* G* ]- i; y4 Y/ \Induction Hypothesis: Let K >=2 be integers, support that
0 t, Y2 e6 C( `& T K^3 – K can by divided by 3.
: Q8 l- s$ M- p: k: z! F. ~) |1 f5 L
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 33 Y; x5 l% A# w3 z) @
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
1 l' N2 i% v; u+ _2 {! M" ~Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)1 z9 F& B" `/ S% L' a
= K^3 + 3K^2 + 2K, \' o% p0 H& @
= ( K^3 – K) + ( 3K^2 + 3K)- F. l( H8 @. P; d
= ( K^3 – K) + 3 ( K^2 + K)
& n! f: h, `6 F8 \ s' Z5 g6 \- qby 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# y0 j; o8 L* S
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
0 k7 X+ i- V1 V& l) S = 3X + 3 ( K^2 + K)2 y% N) C- ^" L) W' n, R$ e0 C$ w
= 3(X+ K^2 + K) which can be divided by 3, e4 u: N9 h# s. U
3 H7 J5 h9 F" t* ^0 S: o, ^Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.5 ], j H$ B! ~
2 _/ ]2 h8 W6 K) M. p1 H/ i[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|