(i) Setting the score equal to 20:
n2−12n+40=20
n2−12n+20=0
(ii) With a=1, b=−12, c=20:
D=(−12)2−4(1)(20)=144−80=64
Since D=64>0 — and it is a perfect square — the equation has two distinct real roots, and they are whole numbers.
(iii) Factorising:
n2−10n−2n+20=0
n(n−10)−2(n−10)=0
(n−2)(n−10)=0
n=2orn=10
The team attempted either 2 or 10 questions. Both are genuine answers — the model gives the same score at two different numbers of attempts.
(iv) Putting n=6 into the model:
S=(6)2−12(6)+40=36−72+40=4
The lowest possible score is 4.
(v) A score of 0 would need:
n2−12n+40=0
D=(−12)2−4(1)(40)=144−160=−16
Since D<0, this equation has no real roots.
So a score of 0 is impossible under this model — which agrees with part (iv): the score never drops below 4.
Parts (iv) and (v) are two views of the same fact. A negative discriminant says the curve never reaches 0, and the lowest point being 4 says exactly where it stops.