2.
x is an integer
(2 marks)
(b)
x is a natural number.
(a)
(1 mark)
(b)
Copy the number line below and draw on it the solution set
for the inequality in (a) above.
8
(CXC) (4 marks)
3.
(a)
(1 mark)
(b)
(1 mark)
4.
5.
x 1 < 10 2 x .
6.
2 x 12 .
7.
2 x < 14 < 3 x + 5 .
8.
(a)
(2 marks)
(3 marks)
(CXC) (1 mark)
(3 marks)
Solve for x
12 3 x + 5 .
(b)
9.
10.
x2 x 6 0
(ii)
x2 x 6 0
(10 marks)
(4 marks)
(a)
(b)
3 1
13 .
2 2
(2 marks)
12.
(3 marks)
y
y = 3 x + 12
y=
3
x6
2
G
0
y=
3
x 6 and the line HK.
2
(a)
(b)
Write down the set of three inequalities which define the shaded
region GHK.
(1 mark)
(3 marks)
Class 8B has decided to sell apples and bananas at morning break this week to
raise money for charity. The profit on each apple is 20 cents, the profit on each
banana is 15 cents. They have done some market research and formed the
following constraints.
They will sell at most 800 items of fruit during the week.
Assuming they will sell all their fruit, formulate the above information as a
linear programming problem, letting a represent the number of apples they
sell and b represent the number of bananas they sell.
Write your constraints as inequalities.
(4 marks)
14.
Each socket is made from 6 components and each switch is made from 7 components.
There are 4200 components available.
(c)
(d)
(f)
Use your graph to determine the number of sockets and switches that
must be made in a day to obtain maximum profit.
(g)
(13 marks)
(CXC)
TOTAL MARKS: 61
1.
2.
(a)
3 , 2 , 1, 0, 1
(b)
(a)
B2 B1
B1
(3 marks)
M1 A1 A1
(b)
8
B1
(4 marks)
(a)
z=4
B1
(b)
y=6
B1
(2 marks)
4.
2 n > 2 , so n > 1
M1 A1
(2 marks)
5.
x + 2 x < 10 + 1, 3 x < 11
M1 A1
3.
x<
11
3
B1
(3 marks)
(1 mark)
6.
x6
B1
7.
2 x < 14 x < 7
B1
B1
B1
8.
9.
7
3
(a)
3 x 7, x
(b)
(i)
( x 3) ( x + 2) 0
(3 marks)
M1 A1
B1
; so ( x 3) 0 and x + 2 0
(3 marks)
M1 A1 A1
x 3 and x 2 2 x 3
[or
( x 3) 0 and x + 2 0
x 3 and x 2 - no solution]
Hence solution is 2 x 3
(ii)
( x 3) ( x + 2) 0
or
so
A1
( x 3) 0 and ( x + 2) 0
M1 A1
x 3 and x 2 x 3
A1
( x 3) 0 and ( x + 2) 0
x 3 and x 2
x 2
Hence solution is x 3 or x 2
M1 A1
A1
A1
41
(10 marks)
10.
(2 x + 1) ( x 5) < 0 ;
so
M1 A1
1
1
and x < 5 < x < 5
2
2
A1
11.
12.
1
<x<5
2
9+4 3 1
=
13
2
2 2
(4 marks)
M1 A1
(2 marks)
(3 marks)
x=
(b)
3 1
3 1
13 < x < +
13
2 2
2 2
M1 A1 A1
(a)
y=6
(2 x 8)
B1
(b)
y6
B1
3
x6
2
B1
y 3 x + 12
14.
A1
(a)
13.
1
and x > 5 no solution ]
2
B1
M1
a + b 800
A1
a 2b
A1
A1
(a)
x 50
B1
(b)
y > 120
B1
(c)
6 x + 7 y 4200
(4 marks)
M1 A1
52
(4 marks)
14.
(d) y
600
x 50
500
400
300
200
x > 120
100
100
200
300
400
500
600
B4
(e)
P = 4 x + 5y
(f)
(g)
700
6 x + 7 y 4200
B1
3900
)
7
1
7
M1
A1
3900
and the nearest
So maximum profit occurs at 50,
7
integer solution in the feasible region is (50, 557),
i.e. 50 sockets and 557 switches.
A1
Profit of $2985
B1
(13 marks)
TOTAL MARKS: 61
63