 鲜花( 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)) m5 R: I$ `. ]5 z$ i2 t% |
9 A. }4 E. m5 h& ?/ t7 _0 f0 O. x
Proof:
5 C% d. r9 I I; [ mLet n >1 be an integer
0 ~6 p/ j2 n1 E6 v- fBasis: (n=2)7 f6 l( Z6 Z1 C$ D; D% m
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3. e p6 Q3 s* B) W% U$ U9 m
6 f+ J8 h9 v, {2 J) E* O
Induction Hypothesis: Let K >=2 be integers, support that; E% w. T4 l; c) e
K^3 – K can by divided by 3.
& J9 d) V6 j" w& f( }# Q" k' b$ D) U& E
% _! ~' _+ Z5 Z% P9 Q# b& f8 FNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 32 f9 X6 l( u; B
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
. D, Q- {0 I) I! u' w* ^Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
+ z A3 e6 v$ p! O0 Y = K^3 + 3K^2 + 2K4 y/ |7 r& _8 t5 V4 |
= ( K^3 – K) + ( 3K^2 + 3K)2 s7 m- l/ l8 q' [) H
= ( K^3 – K) + 3 ( K^2 + K). O1 ?1 X; F+ J6 N# 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
& Q& `) z" M( x( e" ^) j# W1 xSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K): L4 N5 t c, @) N! e
= 3X + 3 ( K^2 + K)- w) E# ~: q8 T8 y
= 3(X+ K^2 + K) which can be divided by 3
, ?5 U+ ?; [- g, d7 A7 @4 V8 `- {0 R* `; K: q
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
/ ]! e2 q4 s% I* |& w" E1 s# f" v2 z" R
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|