 鲜花( 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)# d- Z9 g* \/ Y3 z2 T3 O8 p( r) R
" p; I" ?3 }5 P1 l# N! \& ^
Proof:
7 u5 L7 o+ k+ e" _7 |' xLet n >1 be an integer
; A$ q) _+ c6 F1 Y# ZBasis: (n=2)! J+ @: L7 V8 K, N
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3- k4 H3 L8 _$ `3 S: t: c3 `
& c: F+ {4 m Z9 MInduction Hypothesis: Let K >=2 be integers, support that- T0 M* E8 {6 Y; k
K^3 – K can by divided by 3.
6 j# M. h. b3 \. _( p7 L
, b2 i1 o2 U- GNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
7 C! s. U# @( E% {5 k& rsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
; Y- B" f6 F% [9 h& hThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)8 b& ^' e) o$ ^0 C0 F E, f
= K^3 + 3K^2 + 2K2 q/ y. x4 P: t( [0 z! w9 [( ]# N9 j9 C
= ( K^3 – K) + ( 3K^2 + 3K)
7 h- L1 N# v9 c B! g# y' d = ( K^3 – K) + 3 ( K^2 + K); q' f% ~8 @# E: S& A
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 }, X" n2 Q; i# }" C/ x8 `5 h8 ^
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
, U2 v" N. H2 H0 j! u: V, t = 3X + 3 ( K^2 + K)9 Z! m# _' ?: F' s2 ]/ G/ H
= 3(X+ K^2 + K) which can be divided by 3
; ]* A* |3 ?/ `! `9 l+ x! a. Q) r9 ?5 ~9 m6 }
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.0 J2 H6 }( u9 e" t; ]4 v( ]) F& B
* C# A* e& c* m U3 Q[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|