 鲜花( 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)
1 t( S9 s6 B( J! N6 O5 O2 @3 z% b. e5 y% S7 F4 Q7 \7 F
Proof: , z5 X* ~- ]5 [
Let n >1 be an integer + l9 H$ c1 B# D5 A
Basis: (n=2)
- q, }% g$ w- _' T 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
: z5 z, H- A; e6 V. Z* o% _# h) k# H O4 @7 {
Induction Hypothesis: Let K >=2 be integers, support that
4 c) z0 Z; n5 ^- s$ m K^3 – K can by divided by 3.
+ ?( @; ? }% I7 q4 ?/ I( q' y1 c: ?7 b9 n; v1 {- y& y
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 32 p. ~9 N8 v' z, X0 ?* W6 B
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
, Q* [ s4 Z$ z: g3 a* D. j' {/ cThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
6 \% t5 l4 T6 ]: K; W4 u2 F = K^3 + 3K^2 + 2K6 D3 g6 U3 H- C% F$ g% p+ A9 v
= ( K^3 – K) + ( 3K^2 + 3K)
4 `0 q4 h; |5 p. s = ( K^3 – K) + 3 ( K^2 + K). v% n2 t4 s! y( V0 c% b2 C
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
! ` S1 s" Z. A) T, l( ]So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)) T' Q: T9 h. ~
= 3X + 3 ( K^2 + K)
* x8 T% S! M, ^: _$ B, E. T = 3(X+ K^2 + K) which can be divided by 3
6 B, z1 i1 [+ |' T# s2 C* |0 E1 n- ]6 v% s2 a h0 V- d
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1., }( b6 n2 W$ A
) s8 j8 P/ ?8 B6 x) H
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|