 鲜花( 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)
; [4 u5 b3 w K& c! v- k5 ^: S2 O/ p, ?# P1 x
Proof: , q( Q! V& |+ B U% z
Let n >1 be an integer ! f, c( ~; F! e2 q2 M
Basis: (n=2); G8 @6 d; u: a. U: s7 @1 B. v
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3, ]0 q7 E. ^- ?/ z& F% h- @7 @
$ n( [" H: M( k' a; M, Y# w( I
Induction Hypothesis: Let K >=2 be integers, support that9 g Z! \' K, ~& x/ f
K^3 – K can by divided by 3.
" T9 W( L) p, ^+ A5 d; ? _6 ^. e
* q6 D, s1 E% z) z. I. VNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3$ F! y" q+ ?3 P1 F& T
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem# q. [0 a5 A: k0 v
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
5 D- T& B2 y2 g2 p0 e, _7 L = K^3 + 3K^2 + 2K
# I# n+ Q) b6 J. j; F = ( K^3 – K) + ( 3K^2 + 3K)( B, {& w+ X% F' M
= ( K^3 – K) + 3 ( K^2 + K)
) n; r+ G6 S4 b6 d7 E& V8 ?" Y0 e& Cby 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
& r' g5 X5 f6 i& hSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)& C$ s: r: t4 K; ~
= 3X + 3 ( K^2 + K)
( ?6 m/ y, s1 i = 3(X+ K^2 + K) which can be divided by 3
8 {1 ~( ?1 y7 I2 `: n2 U9 W2 ~2 q5 A9 ~! G% Y
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1." m( S8 S M$ v, `& [$ A2 E( c0 f
K* } l& d% _( C# [4 R" {[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|