 鲜花( 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)
0 U- W' ` a) H- [8 i
9 c( v1 D( m9 S7 K, x* xProof:
: A4 ]0 P+ j3 G: ZLet n >1 be an integer
- K# t" Q" b( t7 ^Basis: (n=2)1 k7 F; C4 s3 ^" ~0 c5 X
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
) y# N, m& i4 V, T6 k; f/ ~4 E9 n5 x: a' G3 F2 K5 w7 x
Induction Hypothesis: Let K >=2 be integers, support that
; M2 f7 Q3 {1 d. ~0 G9 V- q K^3 – K can by divided by 3.1 r1 I/ P* U: A$ T4 z/ A- K
& y1 o' K: P6 I! L, M' wNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
2 K5 z7 f# E/ N& L) k& Ysince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem: U8 @& _* U9 Z( _ R t0 I
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
! {$ }6 W: }( n5 e" r, y* Z = K^3 + 3K^2 + 2K+ Q$ ?2 w$ y3 n1 }* \: D
= ( K^3 – K) + ( 3K^2 + 3K)3 i4 k E& q8 M% R1 Z4 j1 f c3 E
= ( K^3 – K) + 3 ( K^2 + K)
( O( C5 f0 H3 |/ }/ }- J7 hby 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
9 g$ R! R3 I8 W) \ |& jSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
& G/ w* b2 R* u7 e" A# u = 3X + 3 ( K^2 + K)$ e- \6 \, v) B' A h
= 3(X+ K^2 + K) which can be divided by 3
( S* @+ y: C2 Z+ N: {2 U- v) S
# F$ N* ~, S) }# w4 b9 mConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
: a4 u! p" U# ~& r
' f# d. }& a8 X* E1 a& h D[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|