 鲜花( 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) T% b7 g. R' z9 Z# V
' `. t' n' I4 r0 @: D, @" y
Proof: ' t. Z- v: E4 y$ f Q
Let n >1 be an integer - \' n; ]1 ^2 t
Basis: (n=2)
! k# h- ~0 U- e7 Q* r 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 37 F' Q2 q* L- z
3 A8 a. s8 E0 v! z
Induction Hypothesis: Let K >=2 be integers, support that1 o& n+ [* g* t# M' [
K^3 – K can by divided by 3.6 h$ }5 d t5 s' V; \
" c0 f& X/ V, D0 n4 u) U: P
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
, }2 M* n6 k/ ^ D( i( l! F$ M0 k! dsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
/ ^' b/ k& } m5 `9 G+ l* kThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
" x6 T0 z2 K: ~9 \: \5 c2 [ ~- p7 [0 S = K^3 + 3K^2 + 2K/ n, x/ l A2 \1 r6 H1 f9 G# M
= ( K^3 – K) + ( 3K^2 + 3K)3 K, ~0 T. m' R# }7 s' n& U
= ( K^3 – K) + 3 ( K^2 + K)" A( @3 p' c" u, W+ G0 ?/ C! [
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
3 H- V% M' g3 YSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)7 X& j9 Q: q/ ~* J
= 3X + 3 ( K^2 + K)
# u A) k' b5 `9 l, v = 3(X+ K^2 + K) which can be divided by 3
8 w0 a% J6 {. T+ c+ x# V% p0 e
- `; E! w& b" C% s- @* C" \Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
- c; ?' J& X4 E, A: f, S) {7 z/ R- i; w0 U+ Z3 i
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|