 鲜花( 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)0 H+ N: _8 L6 q- |$ {
; h a: L+ Y: o2 U3 P4 l6 \
Proof: ; Z. c# m* g# H: o& g
Let n >1 be an integer
/ }1 e. B3 o/ {4 S5 OBasis: (n=2)
m0 ]5 O5 g, C9 e- r 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 30 K0 p# L4 [2 R; i, W. N1 X3 A
# ~3 Y. Q6 {) ?. v6 B+ O. a
Induction Hypothesis: Let K >=2 be integers, support that
7 r3 }, b4 N' H8 w' O5 F+ s- d" \8 m K^3 – K can by divided by 3.8 G/ Z! ` R6 Q" S& V) K3 i
: Z: `' e9 P% W& z! D& YNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
! i4 [$ O; H+ Xsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem+ }. K4 f: {7 m0 y- Y: H' A4 t
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
& \# l' }3 e3 `' K# R% e& S- m! N = K^3 + 3K^2 + 2K" l+ D3 a! x$ c( i: W' ]! U. b$ [8 a
= ( K^3 – K) + ( 3K^2 + 3K): `& O2 M# \/ I! n
= ( K^3 – K) + 3 ( K^2 + K). S0 Q4 q7 n# v( e. W% t# u
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
! b2 o T: d) CSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
5 d! L! G* ^4 c& r) b9 l = 3X + 3 ( K^2 + K)
: \; C( A( A5 v3 ?. }$ U# R9 w = 3(X+ K^2 + K) which can be divided by 3" M" Q1 }2 w9 X% Y& e( `$ P; k8 v
" y2 q: L( `2 Y% k# G
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.% K! k8 F% t& P8 J1 r& x1 V5 a
2 n, e6 V% S' _/ W' S
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|