 鲜花( 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)
2 m$ N9 G, O; L+ D8 G, s$ o' k+ s* N1 l3 ~/ a" ~0 x4 ~
Proof: - U3 p/ r! v# N$ ^9 E9 h; Q% }3 M
Let n >1 be an integer 4 Q2 V( h5 U* s- J( ?
Basis: (n=2)7 [6 p- R e* o
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
7 C6 U \- O7 g. @; h. \- Z2 I0 {6 ]) b W4 z3 ?% O
Induction Hypothesis: Let K >=2 be integers, support that. f2 v% J' q$ s; ]6 d" F: x, Y4 V
K^3 – K can by divided by 3.+ C% d5 V3 ]- ?6 O& B3 B1 [; [4 i
7 z( V( \. d7 h5 r. `
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
/ A$ ^9 S6 _ Z4 x, f( isince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
! D$ Q c8 d6 w7 q% @" xThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1) P/ W) l# ^( I9 q& ~) _
= K^3 + 3K^2 + 2K4 J% O5 K0 a M
= ( K^3 – K) + ( 3K^2 + 3K)# R! [- L- [* q9 Z4 G
= ( K^3 – K) + 3 ( K^2 + K)" I7 H- u( `& f, R/ b' k
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>06 J5 C1 c. l# `5 `% x+ W8 C6 A
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
% W6 o9 `; n5 b/ J5 J/ j = 3X + 3 ( K^2 + K)
- ^8 J# g5 H. h) v* [0 m) f) d3 z = 3(X+ K^2 + K) which can be divided by 3
" a/ t: n9 G% h" J" v& u1 f3 q
( e/ ]7 [6 @0 P4 S7 \! ` Y4 iConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.% _! X5 T& h" ?- u
: ^; }& m% ?" U" t; P9 O: j; |* F* c
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|