 鲜花( 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 J& Z2 ~9 C* s! E* c$ {" P
, k7 e5 s2 A+ V+ [+ l+ p& K# X3 zProof:
9 v8 L* Y) t3 S1 ?. DLet n >1 be an integer
9 A& t6 v8 D: B% ?9 v- i6 B, KBasis: (n=2)
# L6 [- y. F# l5 l9 Q* ?( _ 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
# d8 ]% b& G! j3 v
* h/ C+ w9 O; H( S5 HInduction Hypothesis: Let K >=2 be integers, support that
7 |* L! X7 d) w5 @2 y K^3 – K can by divided by 3.
* Q4 O+ I8 R. Q3 ~. G( \8 N
# M; T0 ?, @0 j2 p* k" e. kNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
; Y- t) V1 \3 X+ m' ksince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem7 C6 R4 `6 c8 j" z- ]8 Q
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
: _* x4 k6 v; a9 m. P) F. H = K^3 + 3K^2 + 2K# \9 ?8 B- x7 x. A" `8 C& ]
= ( K^3 – K) + ( 3K^2 + 3K)0 q# ]5 }. Z7 C8 w- s- x- U/ M6 j8 K6 e# i
= ( K^3 – K) + 3 ( K^2 + K)# f' p2 \; v: n/ M9 V( u" q
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>04 m( \5 `# y9 f
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
1 F2 E8 u4 B7 k# H( s = 3X + 3 ( K^2 + K)
2 { `5 S! k! n, z( T = 3(X+ K^2 + K) which can be divided by 3
: e. C& \# X- j/ g: s# L. S# D9 I1 F7 v7 ~* R
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
. k7 @5 X; l& x1 V; s* _/ H+ Y$ L: x9 `) `8 W5 x0 m* u
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|