 鲜花( 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)
' v3 w9 M0 Y% q% l% v0 T( _3 Y- S. \, M1 d/ q* r8 Q- {+ m* g! T
Proof:
' @; ~( a2 F ^4 xLet n >1 be an integer
+ o, L; H4 p% b$ f( X2 JBasis: (n=2)0 q' z: G6 K" x5 W9 N
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
( S4 I9 j4 e/ r0 R% s7 [$ w
! v$ M+ t# A) N* v5 ?, m' r( DInduction Hypothesis: Let K >=2 be integers, support that% J$ s2 S; h0 @1 ?( T9 p
K^3 – K can by divided by 3.
- i0 z6 [* s8 q/ w- N6 e$ C1 x& A7 t# [& t9 n9 L& \- R8 s% l
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
5 z/ T8 G8 E5 f1 f8 }& U5 J- M( }# D: |since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem6 _9 Z* {! `6 n# X; g$ `: C
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
8 S- ~4 y/ b( O0 z4 R) Y. m8 Q! G = K^3 + 3K^2 + 2K
) H& Y- H8 o3 q9 ]1 f P = ( K^3 – K) + ( 3K^2 + 3K)
) u# o9 F( x& j+ z = ( K^3 – K) + 3 ( K^2 + K)
/ G% \, ]5 j0 `% y, J. b; h' mby 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
* b c% Y* ^8 ]5 r3 ?( D4 s) `So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)9 [. [9 z+ q& \$ }+ X ^
= 3X + 3 ( K^2 + K)
' U+ P1 U( |; t+ @ = 3(X+ K^2 + K) which can be divided by 3
4 o% }; x' D' K
4 P3 X# H4 W9 K& Z# o) a# xConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
g5 U( e% P3 V! t7 I. w7 q9 F2 g0 M. D/ U: C
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|