 鲜花( 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)6 Q' D J% B9 s0 {. P9 N7 L
3 x+ `8 T% j& j4 F; ]9 wProof: / b7 p6 v. z# Q9 G1 k2 M5 l. v; }2 I
Let n >1 be an integer J( _$ R: P7 b B- z8 m M
Basis: (n=2)
3 \. z- R3 }. o: ?9 `$ p 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
' f; N* z }) c3 U' t+ m- }% `* J. n1 y% m2 X0 M
Induction Hypothesis: Let K >=2 be integers, support that
* s$ V# q; x- g, W H K^3 – K can by divided by 3.
0 D; ^# n0 o. E$ X7 F% n6 S7 e- R& i" e1 H1 z
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3+ ?/ o8 A$ x, d) u# m
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
, N+ M& t4 A0 q2 T# F7 D# E9 O: }6 VThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1) w. T T. Y) Z* v7 Y \
= K^3 + 3K^2 + 2K
( q( [0 U2 q! \+ u1 V9 b = ( K^3 – K) + ( 3K^2 + 3K)
, f3 l) h R/ n = ( K^3 – K) + 3 ( K^2 + K)
4 ^0 Q. z O% H5 q0 `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( ], a$ c( ~) P7 e# g
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)4 c5 W; \; K4 b0 l8 L- M
= 3X + 3 ( K^2 + K)* {3 ?, e6 L4 q
= 3(X+ K^2 + K) which can be divided by 3& c9 ~) W+ |) ?0 K( g! J
6 V: X. M- d4 x$ B+ a
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
- D" t( p' s9 V! N( X7 Y ]
) S( K, y) }, |: ~1 J[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|