 鲜花( 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)
( A- E, Y8 g8 M: ?
% x2 a2 R2 Q8 YProof:
. _7 m- |; [- B) L9 OLet n >1 be an integer , {4 `* x8 K7 e6 x/ j
Basis: (n=2)
+ O' s. {+ Q8 L) u 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
5 x" g2 ?' U3 g) h3 ~
! V) O1 }% ]0 \8 I$ _Induction Hypothesis: Let K >=2 be integers, support that
7 V* w- Y* c: y# f; M* B K^3 – K can by divided by 3.# H: T( M0 I8 |
a% g ]9 y$ t+ Y' fNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
% [7 O. N( H$ ^since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem) |* H& c3 m# s2 L3 c6 S! t, Q
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)0 J4 j; n( L0 {& P% w" P3 X
= K^3 + 3K^2 + 2K# \. y$ ~& k* L" D
= ( K^3 – K) + ( 3K^2 + 3K)! b7 N7 }) T# y% z* X3 f
= ( K^3 – K) + 3 ( K^2 + K)
3 `, l) a* A0 x5 ?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; F# ~& Q9 z! o8 n' }) D0 t; {
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
% y+ b* X& Z3 C0 G. {/ _2 V = 3X + 3 ( K^2 + K)4 w. L' P4 y# `: ^
= 3(X+ K^2 + K) which can be divided by 3
3 u( b. P& `- }7 S) G; W1 |
9 i) d7 r' Z8 s; u/ s: FConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.* N; l- W% |* @+ u( w
* R' N8 e( e. j# s[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|