 鲜花( 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)
, p7 r% e ?5 K* l
- n$ a8 o3 M+ G7 @+ `Proof: . ~; x; f( P- G2 @9 r1 |) N4 d2 \$ s
Let n >1 be an integer
( s- a1 S7 r9 p. p) E5 aBasis: (n=2)
" s- X U! b" U/ Q: E; w% z 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
6 m$ v# ?/ [/ z6 f" X3 e2 [* F2 s! H" i
Induction Hypothesis: Let K >=2 be integers, support that$ O3 d, z0 G/ n8 ?+ y/ i
K^3 – K can by divided by 3.
' v* {" O( P/ {+ u0 w2 S6 W7 [ E4 p! G$ W0 \. N0 j4 f5 q
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3$ n' k d1 f) e/ E6 T! T
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
2 U+ B, F3 r# @) x2 j2 y6 g+ m1 w$ AThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)6 E+ [& _, @* h# p7 ~5 c
= K^3 + 3K^2 + 2K, q: @) z" t) b; L9 |2 \! ^0 p m
= ( K^3 – K) + ( 3K^2 + 3K)
4 d' `4 z k5 K7 P& z' G = ( K^3 – K) + 3 ( K^2 + K)% s! ~2 f, G4 q9 n' F
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 z V, S3 I' G0 p% q1 w! x+ f* ^So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
4 b! _6 E8 L; o! d = 3X + 3 ( K^2 + K)
8 T0 K1 M8 q! a: R! q7 @5 o9 h = 3(X+ K^2 + K) which can be divided by 3
& J( r& ~- x j# \9 p- |7 ~9 `
! g. H/ G. Q1 |2 j1 T( iConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
1 U" ?2 l" O1 Y# J9 m h3 H3 K$ i' y r' C- Y, b& [
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|