 鲜花( 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). V9 o* a5 [: ]# A
0 g/ f. L4 o0 \1 ?( d/ ]! @* Y d
Proof: ! I' c% S! p' S9 ^/ t* L9 ~8 z6 ]4 \
Let n >1 be an integer
8 d; y) O; s0 L8 \$ J' s1 K# IBasis: (n=2)
* H4 R4 G1 d9 ] 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
- W- x1 l! O( c% c# q) x! Z4 k# H8 f' T9 O$ ~0 @# A ~+ g" R
Induction Hypothesis: Let K >=2 be integers, support that5 H2 J x7 `1 X) v' R! a$ }
K^3 – K can by divided by 3./ H9 o) |- G/ O9 q% v9 u
- Z+ ~1 i" U7 |, s4 r) P, X; I5 H5 tNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3+ d6 F! R; a' K. k+ M8 B
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
- |# d1 U) p; ^. J* W Y# [ O# a% xThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
; K u! l- h/ j = K^3 + 3K^2 + 2K
1 V) P) \/ l6 P* j1 {; Q- } = ( K^3 – K) + ( 3K^2 + 3K)4 O: P, S5 l" ]1 v5 p; T, X
= ( K^3 – K) + 3 ( K^2 + K)' `: E3 ?5 j& Z- m
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>08 [/ m( p7 N$ F3 o; E( g
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
! b7 m! t/ @/ V( u* @2 n = 3X + 3 ( K^2 + K)
& j# D( H/ S5 P. m" g = 3(X+ K^2 + K) which can be divided by 3
; z! k. I; `7 v0 I8 k. U2 e7 U+ V0 O- G3 u9 o- W& f3 x" k
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
% `+ F- O. Q$ p9 V
1 c1 F$ q* h8 O U2 Y# U9 D; H3 j[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|