 鲜花( 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)
3 A2 O8 C' A) ^2 [) `
M/ M7 F; U& X1 B6 {4 [Proof:
3 _. \! H0 Q" A/ F3 v; eLet n >1 be an integer 2 V# n2 [ g+ r9 h3 r
Basis: (n=2)
) u6 o: f7 o, M; z9 T 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 35 e* Z- C7 A7 Q$ n7 O/ t7 Y! v& L4 J
( X' w) d9 X- T8 l7 gInduction Hypothesis: Let K >=2 be integers, support that% T& J" H1 w' H! h! ~! \8 v
K^3 – K can by divided by 3.$ T! N8 G( P# d+ Y! d
+ @% R J% [8 I1 J
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3) C) _" }& k. h
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem+ E! y, `" s6 u$ g1 j) J5 L* m: u
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1). u1 s) z; i; [4 `& u8 P0 j
= K^3 + 3K^2 + 2K/ ]5 Z$ e. N) X! M- u% s0 O8 V: J1 E
= ( K^3 – K) + ( 3K^2 + 3K)( R; Z' w6 I% Y2 ^8 g) }
= ( K^3 – K) + 3 ( K^2 + K)) Q L! F) H. r4 |! o1 C$ s
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>02 R0 K; a _0 `
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)# _) |8 D* o/ r3 Y" ?6 l$ |& T W# P
= 3X + 3 ( K^2 + K)
- [- i& i! d0 Z+ A7 T = 3(X+ K^2 + K) which can be divided by 3; y/ I m, ^& ?8 ^5 G6 n$ [
: t/ ~" b7 N: n+ e) d) CConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.2 s( J; u8 U) \$ c5 F6 R, g
+ m0 i$ v; m* H& Z# v: r, ^[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|