Professional Documents
Culture Documents
Level 3: New Century Mathematics (Second Edition) S3 Question Bank 3A Chapter 4 Linear Inequalities in One Unknown
Level 3: New Century Mathematics (Second Edition) S3 Question Bank 3A Chapter 4 Linear Inequalities in One Unknown
S3 Question Bank
3A Chapter 4 Linear Inequalities in One Unknown
Level 3
<code=10127272>
<bk=3A><ch=4><ex=4A><type=L3><mark=7><title=10127272><content>
4 5 1
Given that a > b > , prove that < .
5 6 5a 1 b
(7 marks)
Solution:
4
b>
5
4
5b > 5 1M
5
5b > –4
5 + 5b > 5 – 4 1M
∴ 5 + 5b > 1
∵ a>b
∴ 5 + 5a > 5 + 5b 1A
Obviously, 1 + (5 + 5a) > 5 + 5a.
∴ 6 + 5a > 5 + 5a
∴ 6 + 5a > 5 + 5b > 1 1M
1 1
∴ <
6 5a 5 5b
1M
5 5
<
6 5a 5(1 b)
1M
5 1
∴ 1A
6 5a 1 b
<end>
Q R
Q c R
C
fence
region
fence
A D
wall
Show that the area of the region is maximized when the longest fence is taken as the height of
trapezium ABCD.
(Hint: Consider the areas of all the possible regions formed by choosing different fences as the
heights.)
(6 marks)
Solution:
Let p, q and r be the lengths of the three fences, where p > q > r.
(q r ) p
When p, q and r are taken as the heights, the areas of the regions formed are ,
2
( p r )q ( p q)r
and respectively. 1M
2 2
∵ p>q
∴ pr > qr 1M
pq + pr > pq + qr 1M
(q + r)p > (p + r)q
(q r ) p > ( p r ) q 1A
2 2