 鲜花( 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). {2 G' X5 K8 |5 o) e. [
9 ?* c% n# ^" s0 i4 H
Proof: ! Q& d9 n! x7 x- ]9 G9 ?0 @% L
Let n >1 be an integer
9 Y' i# q- a: EBasis: (n=2)4 b; @8 H/ A; u' L! {
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3. @9 a1 D7 R" v/ Z# G9 X- K& P
' ?1 m/ V: t5 b& E' ]# i! s" gInduction Hypothesis: Let K >=2 be integers, support that( S' p% { _( c8 |# E# _/ ?. V# \* x8 y
K^3 – K can by divided by 3." n, Z" |" q3 s* x! [' D
+ x, o. ?# t" e9 H1 A
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
6 R0 X% K5 t0 c7 e( Esince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem- w: Q+ G- r3 I {6 M+ p: q
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)5 W3 b& d3 ~" X) l
= K^3 + 3K^2 + 2K, F, N% e3 X" J+ ?' ^
= ( K^3 – K) + ( 3K^2 + 3K) T& A8 T2 V( N1 z0 k* d) Z
= ( K^3 – K) + 3 ( K^2 + K)" w+ z6 I- ?( J( g1 ~
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
, _. t5 e) x% G% S. zSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)% d/ Y, f3 ] I9 E1 D: x
= 3X + 3 ( K^2 + K)
" _# a2 o1 H+ D0 a! E0 n( u8 d9 h = 3(X+ K^2 + K) which can be divided by 3' a2 V$ h) X* ^2 q8 J. X T! y d$ _
: j- ~/ y, U3 n: V7 w4 Q' Y9 J
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.2 g4 X5 t7 o0 s, @
) r$ C: u3 [7 G8 l& j! K" R3 K
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|