 鲜花( 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)
1 t5 h# }1 T" c E9 _( m
! N; y+ B; G* C9 M" V! \Proof:
" M( t; n7 n6 @/ [5 ULet n >1 be an integer
3 N* J5 a" y+ F3 t0 X: z& h0 o) g, DBasis: (n=2)- l9 g; F$ @- c5 ^& H6 F0 Z, J/ n
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3" I9 W& E; o+ Y" t9 S+ x8 k2 h! t
$ W* P5 W c" ~% CInduction Hypothesis: Let K >=2 be integers, support that
+ \0 Z+ [$ P1 }9 h K^3 – K can by divided by 3.- R+ Z: R) i6 C Y* r0 F
4 \5 f, `# I, i# h6 J& b# o/ S
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
' I r; h) G$ Z, nsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
) C6 Z/ N9 J! w; o4 r! d3 J+ f, IThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
' H! Z0 Y+ i: l ~2 w7 h& C* q) y = K^3 + 3K^2 + 2K
|8 W9 U) _% V = ( K^3 – K) + ( 3K^2 + 3K)8 _5 {3 U; |: n2 _: {
= ( K^3 – K) + 3 ( K^2 + K)$ `& Z$ t( L' |7 u; @
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
7 e% s! G- a9 a" c! O5 a3 ESo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
0 \# s- Y# p$ w = 3X + 3 ( K^2 + K)4 `2 F. V6 s; s3 ]" v
= 3(X+ K^2 + K) which can be divided by 33 X8 Q. Z9 d7 Y" S$ m% h; U* y
( X% d- C# C9 v6 G$ P& ~1 m
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
2 d: A7 e5 v2 W. j! F$ U. S: H0 }! u. O" Q; T" p% Q
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|