← Review packs
Solutions — Full Answer Key
MathematicsYear 10 · Functions
Solutions · Full Answer Key
Pack A answers · Pack B answers · Problem-solving worked solutions
Pack A — Answers
Bronze
1.
2.
3.
4.
5.13
6.
7.
8.,
9.
10.
Silver
11.Domain: ; Range:
12. (i.e. )
13.Range:
14.
15.
16.(a) 16 (b) 10
17.
18.
19.; at
20.
Gold
21.
22.
23.
24.
25. or
26.
27. ✓
28.11
29.4
30. (for )
Platinum
31.
32.
33.(a) (b) (days for cost )
34.(a) Min = 2 at (b) Range:
35.
36.,
37.
38.
39.10 minutes
40.
Pack B — Answers
Bronze
1.
2.
3.
4.
5.17
6.
7.
8.,
9.
10.
Silver
11.Domain: ; Range:
12. (i.e. )
13.Range:
14.
15.
16.(a) 36 (b) 18
17.
18.
19.; at
20.
Gold
21.
22.
23.
24.
25. or
26.
27. ✓
28.17
29.5
30. (for )
Platinum
31.
32.
33.(a) (b)
34.(a) Min = at (b) Range:
35.
36.,
37.
38.
39.10 minutes
40.
Problem-solving — Worked Solutions
1Problem 1
Answer
(a) 32, 212 (b) (c) 100°C (boiling point) (d)
Full working
(a) ; .
(b) Solve for : , so . Inverse: .
(c) . Interpret: 212°F = 100°C (boiling point of water).
(d) Set : , so , . So **C = F**.
(b) Solve for : , so . Inverse: .
(c) . Interpret: 212°F = 100°C (boiling point of water).
(d) Set : , so , . So **C = F**.
2Problem 2
Answer
(a) 5, 6, 17, 27 (b) ; (c)
Full working
(a) ; ; ; .
(b) . .
(c) .
(b) . .
(c) .
3Problem 3
Answer
(a) (b) (c) for
Full working
(a) . So .
(b) . So .
(c) . Since , , so , giving . So , defined for .
(b) . So .
(c) . Since , , so , giving . So , defined for .
4Problem 4
Answer
(a) m (b) (c) (d) m (max area = 450 m²)
Full working
(a) Total fencing used: . So side along wall = .
(b) Area = .
(c) For a valid rectangle: and . So domain .
(d) . Vertex of downward parabola at m. Max area: m².
(b) Area = .
(c) For a valid rectangle: and . So domain .
(d) . Vertex of downward parabola at m. Max area: m².
5Problem 5
Answer
Full working
Let . Then . Set equal to :
-
-
So .
Check: ✓.
-
-
So .
Check: ✓.
6Problem 6
Answer
(a) Yes (b) No (one-to-many) (c) Yes (d) No (one-to-many)
Full working
A function must assign exactly one output to each input.
(a) **Function.** Each student → exactly one ID.
(b) **Not a function.** A town has many citizens — one input maps to multiple outputs. (It's a relation but not a function.)
(c) **Function.** For each , is a single number.
(d) **Not a function.** Each positive has *two* preimages: . So one input maps to two outputs.
(a) **Function.** Each student → exactly one ID.
(b) **Not a function.** A town has many citizens — one input maps to multiple outputs. (It's a relation but not a function.)
(c) **Function.** For each , is a single number.
(d) **Not a function.** Each positive has *two* preimages: . So one input maps to two outputs.
7Problem 7
Answer
(a) (b) (c) , domain
Full working
(a) Denominator cannot be zero: . Domain: .
(b) takes every non-zero real value (as , but never reaches it; as , ). Range: .
(c) Solve : , so . Inverse: . Domain: (matches range of , as expected).
(b) takes every non-zero real value (as , but never reaches it; as , ). Range: .
(c) Solve : , so . Inverse: . Domain: (matches range of , as expected).
8Problem 8
Answer
(a) Approx (b) No (c) Inverse not a function on this domain
Full working
(a) From the given values, ranges from to (taking values ). Estimated range: .
(b) The value appears at both and — so two different inputs give the same output. **Not one-to-one**.
(c) An inverse function must assign a unique input to each output. If two values share an output, you cannot decide which to map back to. So a non-one-to-one function does **not have an inverse** unless you restrict its domain.
(b) The value appears at both and — so two different inputs give the same output. **Not one-to-one**.
(c) An inverse function must assign a unique input to each output. If two values share an output, you cannot decide which to map back to. So a non-one-to-one function does **not have an inverse** unless you restrict its domain.
9Problem 9
Answer
(a) (b) (euros to pounds) (c) £423.73
Full working
(a) .
(b) . So . This converts euros back to pounds.
(c) .
(b) . So . This converts euros back to pounds.
(c) .
10Problem 10
Answer
(a) Not 1-1 (b) (c) (d) Both equal what they should
Full working
(a) : two inputs give the same output, so is not one-to-one and has no inverse on .
(b) Restricted to : is one-to-one and onto . Inverse: .
(c) Restricted to : outputs again cover but inputs are negative. Inverse takes positive to negative root: .
(d) For (b):
- ✓.
- ✓.
(b) Restricted to : is one-to-one and onto . Inverse: .
(c) Restricted to : outputs again cover but inputs are negative. Inverse takes positive to negative root: .
(d) For (b):
- ✓.
- ✓.
11Problem 11
Answer
(a) See working (b) See working (c) (constant — not invertible) or for any
Full working
(a) . So applying twice gives back → self-inverse ✓.
(b) ✓.
(c) Require . Compute: . Set : and , i.e. .
Case 1: , then . So (the identity, trivially self-inverse).
Case 2: , then — any . So for any .
**Family of self-inverse linear functions: (plus the identity).** Geometrically, these are reflections across the line .
(b) ✓.
(c) Require . Compute: . Set : and , i.e. .
Case 1: , then . So (the identity, trivially self-inverse).
Case 2: , then — any . So for any .
**Family of self-inverse linear functions: (plus the identity).** Geometrically, these are reflections across the line .
12Problem 12
Answer
; unique because is one-to-one
Full working
Let . Then .
Set equal to :
-
-
So .
**Uniqueness.** is linear with non-zero gradient → one-to-one → invertible. Given , the function is forced to equal , which is unique: ✓. So ** is unique**.
Set equal to :
-
-
So .
**Uniqueness.** is linear with non-zero gradient → one-to-one → invertible. Given , the function is forced to equal , which is unique: ✓. So ** is unique**.
