 鲜花( 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)/ F/ `) h! V" e2 m
% R7 \- C) ~+ @3 l l, K$ V: l K
Proof: ' z( H5 g U9 v3 v; W
Let n >1 be an integer 0 r2 a" q5 r- z+ b
Basis: (n=2)7 r6 t$ t9 d/ v$ q9 v
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
* `# a' _/ G9 X' N- c" o5 ?4 s! X9 K# v0 R! M- u& k! g k" U
Induction Hypothesis: Let K >=2 be integers, support that7 ?( s7 o9 S ?% n: L I
K^3 – K can by divided by 3.! q/ X3 I7 _6 Q+ T, S6 b
. y$ E5 _& X* }! D$ F5 Q- t$ L
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 35 g' N# i e1 F- l) J% f" f. v
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
2 O0 y" Y. T5 Y& s V, xThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1); m$ m: I0 ]4 @3 [( O% K
= K^3 + 3K^2 + 2K
3 a1 x% T, j4 N+ ?4 U! U = ( K^3 – K) + ( 3K^2 + 3K)$ n+ e- t5 Q" Y! P3 X
= ( K^3 – K) + 3 ( K^2 + K)
1 R# S4 h/ Y/ h& N5 Q, S# cby 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
( A+ q6 u; c8 S. aSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
7 ~/ T5 ^, K% R. t. E- R3 C% V = 3X + 3 ( K^2 + K)7 W3 Y8 j! V7 ?" V# G1 I
= 3(X+ K^2 + K) which can be divided by 3
- U: ~' }' f. f, l" w: z% A3 c" d- Y5 @8 j. z& {* U3 r" A/ s
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
9 `4 l( D* S9 R2 z/ M4 a: G/ J
6 u- @2 p+ u9 V- F; C; B7 E! R- X[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|