 鲜花( 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); @: R( B# N |" C0 q4 o
, W4 Y" o, ^. W# F, z
Proof: & [- o3 V3 k- g, n' F! A
Let n >1 be an integer 3 Z- q% _% r+ ^; o! ?% c; A# I
Basis: (n=2)
+ |7 Q% Q3 M2 I3 d3 ^3 A 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
, I$ i. h, S: m/ A7 a4 w
' M. m6 O1 Q0 S% o D( R; D& b# k ~Induction Hypothesis: Let K >=2 be integers, support that. H$ f5 w4 n6 z7 ]3 ^) a$ j X" Z
K^3 – K can by divided by 3.) c/ u+ N+ e2 z' \* h% d
: s2 V/ R, u$ i% |2 n$ ^
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 30 v: B; V6 n3 C0 l8 s
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
& \2 h3 X: I% R: @5 uThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)" m0 I. k( P w) B' y& y0 L
= K^3 + 3K^2 + 2K: c% b2 H# |& b, q+ x+ Z; T- Z
= ( K^3 – K) + ( 3K^2 + 3K)8 `5 T- j. b- t; x1 ?+ H6 H
= ( K^3 – K) + 3 ( K^2 + K)
9 T, I$ W; X5 @; I" tby 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+ r# k& ?, y! \4 d! M/ y% V
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)/ a; E. C. p( N3 U
= 3X + 3 ( K^2 + K)( m3 w2 Y- i" g
= 3(X+ K^2 + K) which can be divided by 3
% Q2 N8 a( G! Q" v0 m; U) [
6 P2 @, f# y3 l8 Q3 L8 nConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
. ?, r: q a- b# v8 k
' r8 J* l2 U# C0 C[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|