 鲜花( 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)
! s( t( i; G- X* r; l6 i/ F$ T; `! p$ C" l' W( r
Proof:
! ?' i7 L+ R4 iLet n >1 be an integer
8 L: f1 W9 W! D: q+ G' ~5 J5 C. h( iBasis: (n=2)
# A9 n) _6 v! P" k2 { 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
$ }% z7 M0 q4 a1 h( Y- `' A
4 F1 m0 P, d; D3 x1 L, I sInduction Hypothesis: Let K >=2 be integers, support that) m# P# G5 I# E2 x$ ^, `+ t d8 y4 A
K^3 – K can by divided by 3.7 ?, d! z% j% A
' ]7 _$ [0 S5 |0 f; H* R
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3- E2 `8 i. G1 }" s* ~
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem& \/ Q% @4 i( I7 D8 e
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
) v6 o& q! j7 p s- R! Z = K^3 + 3K^2 + 2K) X+ M" y: ]: w7 N
= ( K^3 – K) + ( 3K^2 + 3K)
2 u+ A4 d( y5 r% x1 g# {5 S = ( K^3 – K) + 3 ( K^2 + K)
: ~$ n$ c. {- ^* I' c' E3 B) sby 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$ n7 x$ g' |: x
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
0 H e' m) J9 g" m/ s = 3X + 3 ( K^2 + K)
+ T: T5 c$ E3 L" c$ c9 f = 3(X+ K^2 + K) which can be divided by 3
9 D/ H C+ m+ ^" x* O/ m! b* m0 D( ?% o( r6 N5 l
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.3 U) F* j+ i9 s5 K! [2 k
* }0 ?$ r( P5 s J* V$ o[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|