 鲜花( 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)" j7 {) B& ~: E; h7 j/ ]: ~) ~
* H3 D9 x, T$ V1 ]( ~9 l, ]+ y6 sProof:
' B% N9 J, J1 J3 w2 U cLet n >1 be an integer % U1 c( J# n3 W1 a: D. o5 Q5 N% b
Basis: (n=2)
- t. E/ q8 W( \7 } 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
# Z9 H" E1 U9 f! j( o w- Y v, U4 K! ^( j8 X/ t2 {/ Y
Induction Hypothesis: Let K >=2 be integers, support that& ]7 |! F3 u8 z0 M3 z& I D! H
K^3 – K can by divided by 3.# A- j' ^$ r: \0 U d1 I8 r
) ]) ]2 E! `+ x: c# Z
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3* ~6 a) n9 H6 s* f( X$ Q% O3 N
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
# ~- W( q8 ~) |7 [) X+ K; a/ tThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)5 _# M' A+ ^3 z, s9 l
= K^3 + 3K^2 + 2K, @. G1 P% z3 X3 z+ V) I/ F. C
= ( K^3 – K) + ( 3K^2 + 3K)5 i& T" ?$ W$ g
= ( K^3 – K) + 3 ( K^2 + K)
7 m# ?! j1 H3 b5 J E" ~+ S7 D) rby 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
. K1 l. t$ F, C; J9 h" @So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
/ o; ?& `, V9 T% N* v0 ^( D5 s = 3X + 3 ( K^2 + K)
4 B, Y- f$ Y- W! T = 3(X+ K^2 + K) which can be divided by 3
c6 H9 k0 T. d! ] K1 ^
) |: y9 W- ]; w6 ^" Q- zConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
0 k0 \( G% |, F) H8 @: ^& p& T2 w8 h7 p# B: A' h
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|