 鲜花( 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)9 G( D/ ]! ?7 L9 ~) x# [
% S4 g5 C1 F% A# oProof:
. v1 O& a6 U: S3 J* |& DLet n >1 be an integer 7 n7 s6 D2 [$ r9 S
Basis: (n=2)
, [ r- l0 Q5 Q' z 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
, a1 a. L6 @$ X. h e
, J4 |& ?* n7 n' L7 a, n3 e; u4 M |Induction Hypothesis: Let K >=2 be integers, support that9 P' ?, {2 a: L, B( I# [, R
K^3 – K can by divided by 3.
0 A( ~% z5 ]7 m) r: ?8 o6 p; x# V
0 W7 ^! J$ e9 Z8 m/ x8 ~Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 35 z. U0 F+ H3 C/ o( n$ b
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem+ {; g( U# s ]3 W7 u
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
% W1 z0 j( r( p! ?3 i7 o Z9 z = K^3 + 3K^2 + 2K; ~4 M/ X: M1 u; _. a+ h
= ( K^3 – K) + ( 3K^2 + 3K)$ Z. |. f- L5 y9 i0 I8 C
= ( K^3 – K) + 3 ( K^2 + K)$ Y2 H; q* \5 Q2 Y1 h _" R
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
7 `" x {( \2 p% m8 c, _, I% QSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
- Y0 l* n8 \ } = 3X + 3 ( K^2 + K)) D7 |& X5 k2 H" a8 Y$ g
= 3(X+ K^2 + K) which can be divided by 3! i5 c% P* T3 g* U3 O) a2 G
* P0 B( v: r7 f1 h B. WConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.5 x& j% U7 s9 ?+ |6 l
! Q" z+ S r) @3 U z' ]: H[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|