 鲜花( 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): H* Y! M3 _- _, ?) a
% q8 h6 r3 ~. l% h/ P4 uProof:
4 h# b' D* l9 d7 D. o8 m; ~Let n >1 be an integer - b1 z2 q p3 N' `6 c
Basis: (n=2)8 t/ C* z8 F! w/ B/ q! `
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
0 G' r; ~& s- m
) k- i2 r+ D I# r) J+ nInduction Hypothesis: Let K >=2 be integers, support that9 r8 c6 p$ C$ @7 x1 r+ x9 M6 n. z
K^3 – K can by divided by 3.6 u2 `- v$ k N6 b3 ^- S6 G! [& X
3 B8 Y6 H/ q( A5 C0 [9 V# tNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
0 l/ H( @9 ?+ |8 k3 }since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem% `$ o' z3 M2 e9 u3 {& t; H
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1): z5 |7 ?- c. C3 K+ ?' ^3 ^
= K^3 + 3K^2 + 2K
+ ] V( j4 h9 L" W4 L) S = ( K^3 – K) + ( 3K^2 + 3K)5 A9 c. i4 |, l" K
= ( K^3 – K) + 3 ( K^2 + K)! ~6 M$ P- h9 |' S* P. z( d
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>05 y0 V2 ^, H( ?$ d' o6 t
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)2 F2 t% u# l- F7 C
= 3X + 3 ( K^2 + K)
6 |9 {, n& ^+ l1 _2 \8 s = 3(X+ K^2 + K) which can be divided by 32 L+ a9 k7 L5 [" R; j% n+ o
2 e* A4 m2 O+ \) A7 B9 ^. ~
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
1 c. H6 O) G3 ?' H* d4 ?( K9 x7 N" q0 N# V! @
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|