 鲜花( 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 V5 c6 a" W( }' x. _$ I0 K
0 r: i5 T4 E5 q+ k `* L. }5 o
Proof: " D) J2 z( Y+ u
Let n >1 be an integer
5 F( k2 s) v: b; m ?Basis: (n=2)5 s7 z2 k. b% u% @; G9 ?
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3! C4 z, E0 ?, X6 ?: H# F
" ^' V* J4 p) y; C2 S1 O' \Induction Hypothesis: Let K >=2 be integers, support that
# |4 w6 b9 G$ W+ b. W! H K^3 – K can by divided by 3.
`/ y+ l! g, l3 x
1 q$ V) d! w0 D* e8 H( a" J3 xNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3' x/ `# j2 G8 P
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
7 f3 z D+ f6 ^' `8 g3 ^Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
9 W, E! l. |9 Q$ x% d = K^3 + 3K^2 + 2K
7 \# z' ]' ~2 o; J* V. o7 M = ( K^3 – K) + ( 3K^2 + 3K) h- Z$ A* Y. s& H7 n' `/ g
= ( K^3 – K) + 3 ( K^2 + K)
0 {# K, _; a. T& b: k6 Y; [* }+ Eby 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; E0 [: q4 D- GSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
, E- Q8 H* c0 W# X* n( p3 S = 3X + 3 ( K^2 + K)6 ^( L) w% S3 w* u3 {+ A1 C6 B) y
= 3(X+ K^2 + K) which can be divided by 30 X+ y6 j& E$ N. ?
% B+ i" q1 U9 Q9 _# u' z& ]Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
, e& U8 u! o9 \ Y; D0 o3 Y4 N2 v; Z0 b8 q& A' P* u0 @3 K
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|