Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

2007 2008S6HyearlyPmath 1 Sol

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 8

King’s College

Half-Yearly Examination 2007-2008


Pure Mathematics I (Suggested Solution)
Section A (60 marks)
1. (a)
1 2!( n − 2 )! 2
= =
C2n
n! n( n − 1)
2 a b
Let n( n − 1) = n + n − 1

∴ a(n – 1) + bn = 2
Put n = 1, we have b = 2.
Put n = 0, we have a = -2.
1 2 2
∴ C n = n −1 − n
2

(b)
 1 1 1 
lim1 + + +  + n 
n →∞
 3 6 C2 
 2 2   2 2   2 2   2 2 
= lim  −  +  −  +  −  +  +  − 
n →∞
 1 2   2 3   3 4   n − 1 n 
 2
= lim 2 − 
n →∞
 n
=2

0! 1!
(a) C 0 = 0!0! = 1 ∈ Z + , C 0 = C1 = 1!0! = 1 ∈ Z +
0 1 1
2.

∴ P(0) and P(1) are true.


(b) P(0) and P(1) are true.
Assume P(k) is true.
i.e. C k is an integer for 0 ≤ r ≤ k.
r

When n = k + 1,
C 0k +1 = C kk++11 =
( k + 1)! = 1 ∈ Z
( k + 1)!0! +

For 1 ≤ r ≤ k,
C rn +1 = C rk−1 + C rk = N 1 + N 2 ∈ Z + , where N 1 = C rk−1 ∈ Z + , N 2 = C rk ∈ Z +

∴ C rk +1 is an integer for 0 ≤ r ≤ k + 1.

By induction, P(n) is true for all non-negative integers n.


3. When n = 0, (1 + 0)2.20 = 1 = a0
When n = 1, (1 + 1)2.21 = 8 = a1
When n = 2, (1 + 2)2.22 = 36 = a2
∴ an = (1 + n)2.2n is true for n = 0, 1 and 2.
Assume: For some non-negative integers k,
ak = (1 + k)2.2k
ak+1 = (2 + k)2.2k+1
ak+2 = (3 + k)2.2k+2
Then, ak+3 = 2(3ak+2 – 6ak+1 + 4ak)
= 2[3(3 + k)2.2k+2 – 6(2 + k)2.2k+1 + 4(1 + k)2.2k]
= 2k+3[3(9 + 6k + k2) – 3(4 + 4k + k2) + (1 + 2k + k2)]
= 2k+2(32 + 16k + 2k2)
= 2k+3(4 + k)2
∴ an = (1 + n)2.2n is true when n = k + 3.
By the principle of induction, an = (1 + n)2.2n is true all non-negative integers n.

(a) 1 + C1 x + C 2 x +  + C n x = (1 + x )
n n 2 n n n
4.

Differentiate both sides w.r.t. x.


C1n + 2C 2n x +  + nC nn x n −1 = n ⋅ (1 + x )
n −1

n −1
Put x = 1, C1 + 2C 2 +  + nC n = n ⋅ 2
n n n

(b) (i)
n( n − 1)( k − 2 ) C kn−−22 + 3n( n − 1) C kn−−22 + nC kn−−11

=
( k − 2) n( n − 1)( n − 2)! + 3n( n − 1)( n − 2)! + n( n − 1)!
( k − 2)!( n − k )! ( k − 2)!( n − k )! ( k − 1)!( n − k )!
n!
= [ ( k − 2)( k − 1) k + 3k ( k − 1) + k ]
k!( n − k )!
= k 3C kn
(ii)
n n

∑r Cr =0
3 n
r = ∑ r 3 C rn + C1n
r =0

[ ]
n
= ∑ n( n − 1)( r − 2 ) C rn−−22 + 3n( n − 1) C rn−−22 + nC rn−−11 + n
r =2
n n n
= n( n − 1) ∑ ( r − 2 ) C rn−−22 + 3n( n − 1) ∑ C rn−−22 + n∑ C rn−−11 + n
r =2 r =2 r =2
n −2 n −2
 n −1

= n( n − 1) ∑ rC rn − 2 + 3n( n − 1) ∑ C rn − 2 + n ∑ C rn −1 − C 0n −1  + n
r =0 r =0  r =0 
n −3 n−2
(
= n( n − 1)( n − 2 ) ⋅ 2 + 3n( n − 1) ⋅ 2 + n ⋅ 2 − 1 + n n −1
)
= n⋅2 [ ( n − 1)( n − 2) + 6( n − 1) + 4]
n −3

= n 2 ( n + 3) ⋅ 2 n −3

5. Let α be the common root of f(x) = 0 and g(x) = 0.


α2 + hα+ k = α2 + kα+ h
α=1
∴1+h+k=0
Method 1:
Let f(x) = (x – 1)(x – β), g(x) = (x – 1)(x – γ).
By comparing the constant of g(x), we have γ = h
L.C.M. of f(x) and g(x) = (x – 1)(x – β)(x – γ)
= (x2 + hx + k)(x – h)
= x3 + (k – h2)x – hk
= x3 + [k – h(-k – 1)]x – hk
= x3 + (hk + k + h)x – hk
= x3 + (hk – 1)x – hk
Method 2:
L.C.M . of f ( x ) and g ( x )

=
(x + hx + k x 2 + kx + h
2
)( )
x −1

=
x + ( h + k ) x 3 + ( hk + h + k ) x 2 + h 2 + k 2 x + hk
4
( )
x −1
x − x + ( hk − 1) x + [ h( − k − 1) + k ( − h − 1) ] x + hk
4 3 2
=
x −1
x − x + ( hk − 1) x + [ − 2hk − ( h + k ) ] x + hk
4 3 2 1 1 – 1 + (hk – 1) + (-2hk + 1) + hk
= 1 0 + (hk – 1) – hk
x −1
x − x + ( hk − 1) x + [ − 2hk + 1] x + hk
4 3 2
= 1 + 0 + (hk – 1) – hk 0
x −1
= x + ( hk − 1) x − hk
3
6. (a) Method 1:
n n −1 − 1 = [1 + ( n − 1) ] − 1
n −1

n −1
= ∑ C rn −1 ( n − 1) − 1
r

r =0
n −1
= 1 + C1n −1 ( n − 1) + ∑ C rn −1 ( n − 1) − 1
r

r =2
n −1
= ( n − 1) + ∑ C rn −1 ( n − 1)
2 r

r =2

2 r −2 
n −1
= ( n − 1) 1 + ∑ C rn −1 ( n − 1) 
 r =2 
∴ nn-1 – 1 is divisible by (n – 1)2
Method 2:
Let f(n) = nn – 1 and g(n) = f(n) – 1 ⇒ f(1) = 1, g(1) = 0
∴ (n – 1) is a factor of nn – 1 – 1
ln f(n) = (n – 1)ln n
Differentiate both sides w.r.t. n.
f ' ( n) n − 1  1 
= + ln n = 1 − + ln n 
f ( n) n  n 
 1 
f ' ( n ) = f ( n ) 1 − + ln n  ⇒ f ' (1) = 0
 n 
 1   1 1
f ' ' ( n ) = f ' ( n ) 1 − + ln n  + f ( n )  2 +  ⇒ f ' ' (1) = 2
 n  n n
g ' ( n ) = f ' ( n ) ⇒ g ' (1) = f ' (1) = 0
g ' ' ( n ) = f ' ' ( n ) ⇒ g ' ' (1) = f ' ' (1) = 2
∴ (n – 1)2 is a factor of nn – 1 – 1.
(b) Let nn-1 – 1 = k(n – 1)2 for some integers k.
nn-1 = k(n – 1)2 + 1
nn+1 = kn2(n – 1)2 + n2
nn+1 – 1 = kn2(n – 1)2 + n2 – 1
= kn2(n – 1)2 + (n – 1)2 + 2n – 2
= (n – 1)2(kn2 – 1) + (2n – 2)
∴ The remainder is 2n – 2.
7. (a)
x x4 – 2x3 – 4x2 + 6x + 1 x3 + 0x2 – 5x – 3 x
x4 + 0x3 – 5x2 – 3x x3 – x2 – 5x
-2 -2x3 + x2 + 9x + 1 x2 + 0x– 3 1
-2x3 + 0x2 +10x + 6 x2 – x– 5
x x2 – x – 5 x+2
x2 + 2x
-3 -3x – 5
-3x – 6
1

∴ G.C.D. of f(x) and g(x) = 1


i.e. f(x) and g(x) are relatively prime.
(b) 1 = (x2 – x – 5) – (x + 2)(x – 3)
= (x2 – x – 5) – [(x3 – 5x – 3) – (x + 1)(x2 – x – 5)](x – 3)
= (x2 – 2x – 2)(x2 – x – 5) – (x – 3)(x3 – 5x – 3)
= (x2 – 2x – 2)[f(x) – (x – 2)g(x)] – (x – 3)g(x)
= (x2 – 2x – 2)f(x) – [(x2 – 2x – 2)(x – 2) – (x – 3)]g(x)
= (x2 – 2x – 2)f(x) – (x3 – 4x2 + 3x + 1)g(x)
∴ m(x) = x2 – 2x – 2, n(x) = -x3 + 4x2 – 3x – 1

Section B (40 marks)


8. (a) (i) (x1 – x2)2 = (x1 + x2)2 – 4x1x2
= (-x3)2 – 4[p – x3(x1 + x2)]
= x32 – 4[p – x3(-x3)]
= x32 – 4p – 4x32
= -4p – 3x32
(ii) (x1 – x2)2(x2 – x3)2(x3 – x1)2
= (-4p – 3x32)(-4p – 3x12)(-4p – 3x22)
= -64p3 – 48p2(x12 + x22 + x32) – 36p(x12x22 + x22x32 + x32x12) +
27x12x22x32
= -64p3 – 48p2[(x1 + x2 + x3)2 – 2(x1x2 + x2x3 + x3x1)] –
36p[(x1x2 + x2x3 + x3x1)2 – 2x1x2x3(x1 + x2 + x3)] – 27(x1x2x3)2
= -64p3 – 48p2(-2p) – 36p(p2) – 27q2
= -4p3 – 27q2
(iii) 4p3 + 27q2 = 0
=> -4p3 – 27q2 = 0
=> (x1 – x2)2(x2 – x3)2(x3 – x1)2 = 0
=> x1 = x2 or x2 = x3 or x3 = x1
(b) (i) Let x = y + h
x3 – 4x2 – 3x + 18
= (y + h)3 – 4(y + h)2 – 3(y + h) + 18
= y3 + (3h – 4)y2 + (3h2 – 8h – 3)y + (18 – 3h – 4h2 + h3)
4
Set 3h – 4 = 0 ⇒ h = 3

25 250
∴ x 3 − 4 x 2 − 3 x + 18 = y 3 − y+
3 27
(ii) Let the roots of x3 – 4x2 – 3x + 18 = 0 be α, β and γ.
25 250 4 4 4
=> Roots of y − 3 y + 27 = 0 are α + 3 , β + 3 and γ + 3 .
3

3 2
 25   250 
∵ 4 −  + 27  =0
 3   27 

25 250
∴ y3 − y+ = 0 has repeated roots.
3 27
=> Some of α, β and γ are equal.
=> x3 – 4x2 – 3x + 18 = 0 has repeated roots.

9. (a) Method 1:
n! 2 ⋅ n! n!
C kn + 2C kn−1 + C kn−2 = + +
k!( n − k )! ( k − 1)!( n − k + 1)! ( k − 2)!( n − k + 2 )!
n!
= [ ( n − k + 1)( n − k + 2) + 2k ( n − k + 2) + k ( k − 1) ]
k!( n − k + 2 )!

=
n!
k!( n − k + 2 )!
(
n 2 + 3n + 2 )
=
( n + 2)!
k!( n − k + 2 )!
= C kn + 2

Method 2:
( ) (
C kn + 2C kn−1 + C kn− 2 = C kn + C kn−1 + C kn−1 + C kn−2 )
= C kn +1 + C kn−+11
= C kn +1
(b)
n
n! n!
=∑
x( x + 1)( x + 2 )  ( x + n ) k =0 ( x + k ) Π ( − k + i )
n

i =0
i≠k
n
n!
=∑
k = 0 ( x + k )( − k )( − k + 1)( − k + 2 )  ( 2 )(1)(1)( 2 )  ( − k + n )

=∑
n
( − 1) k n!
k = 0 ( x + k ) [ ( k )( k − 1)( k − 2 )  (1) ][ (1)( 2 )  ( n − k ) ]

=∑
n
( − 1) n!
k

k = 0 ( x + k ) k!( n − k )!
n
( − 1) k C kn
=∑
k =0 ( x + k )

(c) (i) 1 = A(x + k + 1)(x + k + 2) + B(x + k)(x + k + 2) + C(x + k)(x + k + 1)


Put x = -k, we have A = 1/2
Put x = -k – 1, we have B = -1
Put x = -k – 2, we have C = 1/2
(ii) Method 1:
n
( − 1) k C kn

k = 0 ( x + k )( x + k + 1)( x + k + 2 )
n
( − 1) k C kn n ( − 1) k C kn n ( − 1) k C kn
=∑ −∑ +∑
k = 0 2( x + k ) k = 0 ( x + k + 1) k = 0 2( x + k + 2 )

1 n! 2 ⋅ n! n! 
= − +
2  x( x + 1)( x + 2 )  ( x + n ) ( x + 1)( x + 2 )( x + 3)  ( x + n + 1) ( x + 2)( x + 3)( x + 4 )  ( x + n + 2 ) 

n!  1 2 1 
= − +
2( x + 2 )  ( x + n )  x( x + 1) ( x + 1)( x + n + 1) ( x + n + 1)( x + n + 2 ) 

n!  ( x + n + 2 )( x + n + 1) − 2 x( x + n + 2 ) + x( x + 1) 
=
2( x + 2 )  ( x + n )  x( x + 1)( x + n + 1)( x + n + 2 ) 

n!  x 2 + ( 2n + 3) x + ( n + 1)( n + 2 ) − 2 x 2 − 2( n + 2) x + x 2 + x 
=  
2( x + 2 )  ( x + n )  x( x + 1)( x + n + 1)( x + n + 2 ) 

=
n!  ( n + 1)( n + 2) 
2( x + 2 )  ( x + n )  x( x + 1)( x + n + 1)( x + n + 2 ) 

=
( n + 2)!
2 x( x + 1)( x + 2 )  ( x + n + 2 )
Method 2:
n
( − 1) k C kn

k = 0 ( x + k )( x + k + 1)( x + k + 2 )

1 n ( − 1) C kn ( − 1) k C kn 1 n ( − 1) C kn
k n k

= ∑
2 k =0 x+k
−∑
k =0 x + k +1
+ ∑
2 k =0 x + k + 2
1  n ( − 1) C kn 2( − 1) C kn ( − 1) k C kn 
k n k n
= ∑ −∑ +∑ 
2  k =0 x + k k =0 x + k + 1 k =0 x + k + 2  
1  n ( − 1) C kn n +1 2( − 1) C kn−1 n + 2 ( − 1) C kn− 2 
k k −1 k −2

= ∑ −∑ +∑ 
2  k =0 x + k k =1 x+k k =2 x+k 
1  n ( − 1) C kn n +1 2( − 1) C kn−1 n + 2 ( − 1) C kn− 2 
k k k

= ∑ + ∑ + ∑ 
2  k =0 x + k k =1 x+k k =2 x + k 

1  n ( − 1) C kn 1 n   n 2( − 1) C kn−1 2( − 1) 
k k n +1
2
=  ∑ + − + ∑ − + +
2  k =2 x + k x x + 1   k = 2 x+k x + 1 x + n + 1 

 n ( − 1) k C kn− 2 ( − 1) k +1 n ( − 1) k + 2 
∑ 
 k = 2 x + k + x + n + 1 + x + n + 2 
 
k
(
1  n ( − 1) C kn + 2C kn−1 + C kn−2 )
1 ( n + 2 ) ( − 1) ( n + 2 ) ( − 1)
n +1 k +2

= ∑ + − + + 
2  k = 2 x+k x x +1 x + n +1 x + n + 2 

1  n ( − 1) C kn + 2 1 ( n + 2) ( − 1) ( n + 2 ) ( − 1) 
k n +1 k +2
= ∑ + − + + 
2  k = 2 x + k x x +1 x + n +1 x + n + 2 
1 n + 2 ( − 1) C kn + 2
k

= ∑
2 k =0 x + k

=
( n + 2)!
2 x( x + 1)  ( x + n + 2 )

n
( − 1) k C kn++11
(d) ∑
k = 0 ( k + 2 )( k + 3)

n
( − 1) k ( n + 1) C kn
=∑
k = 0 ( k + 1)( k + 2 )( k + 3)

= ( n + 1) ⋅
( n + 2)!
2 ⋅ 1 ⋅ 2 ⋅  ⋅ ( n + 3)

=
( n + 1)( n + 2)!
2( n + 3)!
n +1
=
2( n + 3)

You might also like