 鲜花( 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) N% t m1 m7 |" S0 O9 p- `3 n1 a
l- [1 {3 v. U: t. M: V/ YProof: / \) p6 r$ X8 C ]
Let n >1 be an integer
, [0 p% G! J# w8 u, ~) D+ cBasis: (n=2)
; [0 J, r+ x5 I! c 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 35 h6 Y! A6 E5 P4 `3 Z
% M0 b/ s& j: W: H5 c) J5 A
Induction Hypothesis: Let K >=2 be integers, support that% T5 @( G8 `- f! d9 o( X* C
K^3 – K can by divided by 3.
1 `5 A- Y- ]1 W7 [8 W
& a( N4 n% z& \1 r! H, NNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
+ I( y- X. e x: M+ s) L: O- C8 t! ysince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem" q$ \' W; R- W9 A7 K+ Y! Y9 q
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
2 J8 U3 Q k6 W3 O, K, k, L2 E = K^3 + 3K^2 + 2K, K3 U3 s, A" _. ]
= ( K^3 – K) + ( 3K^2 + 3K)
! |% `; O( `6 Z& ~ @1 D& w- F = ( K^3 – K) + 3 ( K^2 + K)6 F: O+ w2 x1 y! M7 q! q& P; U4 ]' J
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
7 O1 C6 d+ {+ \3 w7 M! U; aSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
0 k( [& r, Q, C/ u8 f3 ~+ C- |# \ = 3X + 3 ( K^2 + K)3 v" h3 G5 J+ a- o u2 ~
= 3(X+ K^2 + K) which can be divided by 32 S, R! x2 h; R: w: f: p3 }5 y
/ x* u1 o/ g1 r
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
* u* l S5 ~/ \6 L" g: c9 u- P+ {3 P1 i( X. y
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|