 鲜花( 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)
, J6 u+ l: ~4 K8 E0 }0 g
3 e; h1 y$ X; p1 t1 xProof: 8 Y2 [+ V) d7 b# O; ~
Let n >1 be an integer + j; q( g7 \& r! @" U Q+ K% d) [
Basis: (n=2), p' i7 A* T- X; R
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 35 Q) b/ h! ^. l( C( C
C! W5 }" ]2 M) h4 b7 n
Induction Hypothesis: Let K >=2 be integers, support that
, z* k ]- ?; P+ U8 S. b+ M$ u K^3 – K can by divided by 3.# p c0 h5 Y7 v+ \4 u( G0 |* `
* n) X# |/ G. L; X- y X) e4 I
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 33 O7 b3 v" _% ?% p3 M
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
, Q X5 B1 ~' j" Q( wThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)5 m) N4 p2 B3 K, t& E
= K^3 + 3K^2 + 2K1 Y: o" ~2 P; Z1 L$ k6 U
= ( K^3 – K) + ( 3K^2 + 3K)
1 N" t% K6 s) I0 \5 {8 ~+ q% m6 g6 M8 D+ I = ( K^3 – K) + 3 ( K^2 + K)
$ H/ V+ w2 n) O O" n7 l0 Mby 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+ c: u/ U6 T% w1 o; f8 u/ z
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
0 r- `3 D" u, C( b% @3 x; C0 a = 3X + 3 ( K^2 + K)
9 f; s7 W* q) T& k = 3(X+ K^2 + K) which can be divided by 3
3 o2 n9 m+ ?/ h9 R5 d# F+ B# a
9 \* W7 J' |' p- SConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
8 H2 Y* B0 C! ] i/ \
! O% {! o' I) ?8 a- e[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|