 鲜花( 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)
# w- u" E" p# A6 m; W3 t
0 R G P9 Y0 u* \9 r- @Proof: 9 U3 L" E3 n$ t) e
Let n >1 be an integer
- x# p) b6 [6 b+ H" e/ _Basis: (n=2)0 ^# o, W% H$ w7 E2 v
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3& |0 M$ h) r* T2 n; a) W! q
! f" Q9 ]; f* G2 m! f! |2 B; hInduction Hypothesis: Let K >=2 be integers, support that: |& V* e+ j2 g
K^3 – K can by divided by 3.
; v4 C! E' ]/ A* E- y3 B8 `* `, g1 U- T9 p1 O4 }* V! C
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3, ?4 B3 F5 E: M, \0 I/ d2 a- d) ~
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem: l5 q4 c; b, h0 W
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)% y/ V! ^, _3 [+ Y% o
= K^3 + 3K^2 + 2K3 Z( Y- Y7 w% s2 U" g0 _3 ]
= ( K^3 – K) + ( 3K^2 + 3K)( N9 w3 [( ?1 N7 t/ o0 c
= ( K^3 – K) + 3 ( K^2 + K)2 u3 f! T; W; }5 d0 r
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: v, b- h( P0 u- LSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
* T5 o# n7 v L6 ?9 V = 3X + 3 ( K^2 + K)
* d& T) i5 A' A/ M# s5 H = 3(X+ K^2 + K) which can be divided by 3: g# o& o9 `8 Q8 `3 R
: W$ x) S* l3 MConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.4 i$ C& a3 W& {( R; I2 Z( R
5 O7 Y! U% f& l
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|