 鲜花( 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)
' S5 V5 u& b7 Q
, a5 [7 @. A; v& b( IProof:
( d$ K: ?0 J- h2 w* K/ v2 ]Let n >1 be an integer ' q8 {$ Y: Z2 C4 Q
Basis: (n=2)* \1 \; \3 @' T+ d3 f& f
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3) f1 Y' G* n& Y: {' l- b' e( j
4 J! A+ _/ P9 U; m6 g- {7 y
Induction Hypothesis: Let K >=2 be integers, support that
8 L) C/ H4 v% G- F5 }8 s$ T2 k) ^ K^3 – K can by divided by 3.
& v, f* c8 c- f* |+ h# l s
! p Y8 r2 Q cNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
3 y, a" G7 n4 q! Msince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
2 p( @- P* b: Z( k# W# bThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)+ Y( V( r3 r( S* O: i) g' O
= K^3 + 3K^2 + 2K( g0 I2 _* i+ P3 G( @9 |% X
= ( K^3 – K) + ( 3K^2 + 3K)
- U6 g6 Z2 n5 a1 P8 i: S k! u = ( K^3 – K) + 3 ( K^2 + K)
2 _( M- w0 m. J% v, l& e. @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 J) s ^3 ^" ^( T0 ?( USo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)' E. i, Y3 i/ Q; {
= 3X + 3 ( K^2 + K). _. E( w$ Q _, V3 _+ Q0 Y/ g
= 3(X+ K^2 + K) which can be divided by 3
5 A/ g6 \9 h& I/ x( H8 o( ?, e% W" I
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
$ z- s0 }$ M3 `8 v8 Q
# H( i$ h' |: i, z! j[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|