 鲜花( 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)
: C. X' s: J$ s8 U# i, x$ q2 @, P" M6 C+ }1 G1 L x$ Y: E5 k
Proof:
4 n2 n$ K, |" d5 h6 c' g7 M nLet n >1 be an integer 4 [2 _5 _! M) U) g: v# e
Basis: (n=2)& y5 L3 J/ D5 v' X
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
5 |: ]! J3 P6 C* N% Q# ]9 h1 }( w3 g9 x$ v) }& M$ q% j) b
Induction Hypothesis: Let K >=2 be integers, support that
$ g( q. f$ T. ~* j3 M2 @3 A K^3 – K can by divided by 3./ u2 ^( z2 y) w6 |
2 S" X( a; e# l* v# h2 i
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
7 A# I5 p& |# S7 V* jsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
, J& u& j) m7 |' x) ?% i) hThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)" y9 [; a" t& H& G# h2 m
= K^3 + 3K^2 + 2K
: x. `+ _0 v- q. {0 E# n' Z = ( K^3 – K) + ( 3K^2 + 3K): `9 Q& Q* v2 E, L5 i
= ( K^3 – K) + 3 ( K^2 + K): T/ n. e4 Q( P% p0 S
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
6 Y: O d e/ H0 u; V3 vSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)3 H" [3 k) ]$ n& a4 a" U0 f
= 3X + 3 ( K^2 + K)7 I+ h/ h6 H- v. n
= 3(X+ K^2 + K) which can be divided by 3, b1 s- Y, h) {6 h+ i, Y- l
/ l: ^% f2 S2 A" `Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
$ I6 o6 e( v4 s- N j# M( x$ n/ e$ v$ L( @! e+ E; [% }# c% t0 v
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|