 鲜花( 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)8 | ?+ a" g- ~3 T' u& I
5 U: ]- F& ~. j% h2 T" k- SProof:
; J+ O6 m3 c6 _! F+ ~' ]Let n >1 be an integer
# H4 x9 D# h, x2 n! v" mBasis: (n=2)
. Z1 G3 I- g- H; e1 f8 s 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
y Y% ~+ v- n0 R+ {9 j0 W5 ?1 J8 ^$ D, b Y* I; F, \- ?' r+ Y8 e
Induction Hypothesis: Let K >=2 be integers, support that
1 o* m/ b& l" A1 C7 H0 O K^3 – K can by divided by 3.
) _9 C2 q3 @1 h" w
( B+ q- w" U1 Q& C0 E. O' D; ANow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
: @0 {+ B$ E, q5 T/ F* Qsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem# M. S. q# y0 y+ W' F
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)! V ~0 P3 L6 O& |3 _. X
= K^3 + 3K^2 + 2K
8 p6 }9 P+ x/ x! b8 z = ( K^3 – K) + ( 3K^2 + 3K)
8 J- E# I) w+ b9 V, N = ( K^3 – K) + 3 ( K^2 + K)
! i% `* T1 R9 W, [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
* n( s: Y I1 ?So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
1 w1 T9 i* } K7 T! a+ h4 a = 3X + 3 ( K^2 + K)
) }( A; y. j& i = 3(X+ K^2 + K) which can be divided by 3
+ | R( ?4 }& j* H$ O3 J9 d, `- }" q
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
2 ]3 |$ h( M' N1 q* ]7 W2 ] K& ]/ d4 o; i' O: F4 s' G8 s
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|