 鲜花( 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): A$ N7 y! u, U! B
4 S/ N& s+ ~3 ]% X. S. r, C' I
Proof:
, q! P* r& ]8 W& N* ^# N" NLet n >1 be an integer
, b8 H+ v0 y/ _) w3 P4 O0 J8 dBasis: (n=2)2 \! ^; ?5 e- [
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3) N# `3 Y4 }1 E
! }$ e% R* g& O- e- {7 c' ^# pInduction Hypothesis: Let K >=2 be integers, support that
6 L- o- |1 _8 o) c9 I2 N K^3 – K can by divided by 3.7 ?2 z1 y5 g/ f( q3 g6 Y+ c0 Y
7 ?% k, E& W& mNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
# o- ]4 R; ?1 qsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem1 S* Z4 ?6 }- o1 n# u8 `8 ~% t2 F6 K
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
, m0 h; O. j, d' g = K^3 + 3K^2 + 2K
5 R& o' D! V$ g# u. ?% v = ( K^3 – K) + ( 3K^2 + 3K)
% \; T; R7 s. U2 {3 L- {% l = ( K^3 – K) + 3 ( K^2 + K)
* @' o6 N7 k/ G- f4 V# S% {% |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
( w3 J$ z |2 c1 i5 ^( H6 ASo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
$ G0 D' \ D) l+ B = 3X + 3 ( K^2 + K)) ]% e5 h) @% n+ B4 I
= 3(X+ K^2 + K) which can be divided by 3
) m& V- a a, e- O1 X
1 J; I+ [+ u% ~. X F& E! Z; b& D1 zConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
1 x5 h G/ \% v; g7 Q+ X- ]( O+ b9 a* U" p/ m
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|