 鲜花( 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) H* J+ w- v# Y2 s& o
2 z: B! v, y! u5 w9 }1 e0 A" p/ m d
Proof: + }; C- |; O8 X8 I! b
Let n >1 be an integer 8 O8 }. {+ |/ Y0 o8 }
Basis: (n=2). I9 j6 N/ z( P+ X' C) ^
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
( g! P7 ?7 `% C9 g. z9 n
& m8 U# a* O' Z& v6 S4 L. Y8 SInduction Hypothesis: Let K >=2 be integers, support that6 q* E& G& @) p a! T# y
K^3 – K can by divided by 3.
6 B8 m! s) [4 d3 @
( D) I- W! O- x* j$ l5 K7 K6 P; ONow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
9 N# t1 u z# }) r' ?3 j0 i% `/ fsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem/ R, L! q$ M. _
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
% v+ R+ L$ G2 g0 Z0 d' T0 K$ C = K^3 + 3K^2 + 2K, ?* Z* H) k. i! U
= ( K^3 – K) + ( 3K^2 + 3K)" S: }; ~2 x# K0 c% D# C
= ( K^3 – K) + 3 ( K^2 + K)
: b( n. @" X6 e. p" Kby 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
) z- k) X- T+ ]# d- J" ^- LSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
5 V: x) A% j5 c& ^ = 3X + 3 ( K^2 + K)
6 a6 S! ?& J# _& b8 R# d4 x = 3(X+ K^2 + K) which can be divided by 3
1 @5 @; O# A" I: z+ ]
# g2 H$ Z: O) f- O0 rConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.3 s7 ~: V8 K9 [: c. I
1 @- \- y7 Y1 j" Z
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|