 鲜花( 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)
7 Q* R2 d) B) X: @% O, D- c+ `& a5 P' N" t/ y% E. k9 C
Proof: ! e; i: ]: m& l* `) v+ `& b
Let n >1 be an integer
- _/ X$ J+ S+ y' ~" L5 ?Basis: (n=2)" o/ {: I) d% W1 Y7 \5 X8 [5 f
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
; F- `& e9 _3 v; U* I, m
5 ^1 U7 |* I; B0 V; LInduction Hypothesis: Let K >=2 be integers, support that
) G: g0 N% H. m: T" `! a/ \6 D K^3 – K can by divided by 3.6 W& ?9 j$ Q* s* ~+ H; G1 `: V" A
& |+ ~% q6 ?3 ^$ Z$ L" pNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
8 z* L( _" ~$ O; z" N8 dsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
; r* d% ]+ h! F. n2 {5 w7 D6 L% FThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
/ x' S. u" N' o9 \ = K^3 + 3K^2 + 2K7 k' N7 u; J2 C: J u2 _3 g7 K! t9 d
= ( K^3 – K) + ( 3K^2 + 3K)8 }; H5 j9 M1 D
= ( K^3 – K) + 3 ( K^2 + K); @; r: @' w; R6 d3 n
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
. W2 F' N% i1 O/ P+ qSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
3 B# \: f3 i! k7 @/ |, j: u. j = 3X + 3 ( K^2 + K)
C% g. w) e( z: H n9 a0 _& A& \ = 3(X+ K^2 + K) which can be divided by 3" N1 y; l6 c9 w+ t" a2 O
+ [. F3 z) A' d; E f+ t( [
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
8 s. b& t9 l6 B% B: a
' o0 z" L6 T9 c; v/ m* m7 D[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|