 鲜花( 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)
/ X" m8 v" M% h7 g2 m* G# D% U5 S' |- n- ~- g" T/ r# [
Proof: " ?) }4 ^2 i; @- q8 c6 j. x3 q
Let n >1 be an integer
. |, d' P. i g9 W( ]; n( E# w( kBasis: (n=2)
" }7 C* F5 ?/ y" E8 a 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
8 |7 V7 V2 e: w
( d5 G: i5 ^) TInduction Hypothesis: Let K >=2 be integers, support that/ x) Y( i5 g T
K^3 – K can by divided by 3.% r! b& H2 w5 f! r
! |# l5 c" m1 e4 E/ YNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
2 {+ V8 N$ ^. o! C7 d# u) W7 bsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem9 F' R( J" Y# G" ~ h6 Q: W
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)" [$ L) x( E+ \' Q+ A. x
= K^3 + 3K^2 + 2K5 l& a) ~0 G6 ]- @( n9 `3 y0 [
= ( K^3 – K) + ( 3K^2 + 3K)
1 s5 D b3 n' l; T3 Y* t- t = ( K^3 – K) + 3 ( K^2 + K)4 ?- y/ j ^: O$ T ]$ X; R
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
& s; _% R7 `; J+ G# M; V* j5 P6 ~So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
: O! |& d9 J5 p: A = 3X + 3 ( K^2 + K)
! M. ?* c7 c: j" B8 o = 3(X+ K^2 + K) which can be divided by 3
3 ~7 x0 c# @8 c0 ~: X/ c/ ~$ m2 U' D1 ]# v) }2 }: _
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.: E' a/ j1 B: P: z1 ?: n2 A" h6 u
2 _7 c" q5 |: `* U: m
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|