 鲜花( 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)
$ T5 ~) q. W6 h2 {; D
! ~. E0 i4 h' T: R& |2 }Proof:
" @. R1 G/ V: t8 {Let n >1 be an integer
7 j- F; G( E+ A# X# e9 ]" cBasis: (n=2)1 X5 ^5 v6 W I& b/ a; r- Y8 J
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
( d6 e" X) \ @+ Q6 d3 k- y) I# G/ K. D# {0 f5 u
Induction Hypothesis: Let K >=2 be integers, support that
: ^4 ]- T0 K% z; W5 P K^3 – K can by divided by 3.
# P8 x: W2 B$ w6 B6 y# g/ T3 p: ^
2 Q G: n0 u9 h3 B; n2 {Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 36 n/ e- H4 Y. B
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
, ~! }* X9 e+ [7 ?) N! }Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
* f! d0 I" v5 j8 O = K^3 + 3K^2 + 2K3 Y5 I: c. \3 E! a3 y$ l
= ( K^3 – K) + ( 3K^2 + 3K)* H7 z; A4 Z( V: y5 c+ P
= ( K^3 – K) + 3 ( K^2 + K)
. V4 P9 l8 E( z& m5 V) f/ G" \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+ g4 p% ?, ^5 K, g+ |
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
d( q6 ~% M6 e. \$ {& y8 n4 U = 3X + 3 ( K^2 + K)
$ r* M( ^" [7 V& S = 3(X+ K^2 + K) which can be divided by 3# ], S) l8 ^- h0 O; [
2 _( q7 o$ s% U5 _& T0 n/ E
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
. S$ U3 C. a: e1 t$ U
^- z4 B; K' _" a/ I[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|