Skip to main content
Lemma

TMUA practice: Polynomials, problem 3

A TMUA-calibre polynomials problem at difficulty 4 of 5, with the full worked solution.

The question
If aa, bb, cc are distinct odd natural numbers, then the number of rational roots of the quadratic   ax2+bx+c\;a x^{2} + b x + c
A must be 0\text{must be } 0
B must be 1\text{must be } 1
C must be 2\text{must be } 2
D cannot be determined from the given data\text{cannot be determined from the given data}

The correct answer is highlighted. A

Worked solution

Suppose, for contradiction, that   ax2+bx+c  \;ax^{2} + bx + c\; has a rational root   p/q  \;p/q\; in lowest terms (so gcd(p,q)=1\gcd(p, q) = 1).

Substituting and clearing denominators:   ap2+bpq+cq2=0\;a p^{2} + b p q + c q^{2} = 0.

Analyse parities of p,qp, q:

  • Both pp and qq odd. Then ap2a p^{2}, bpqb p q, cq2c q^{2} are all (odd)(odd) = odd. Sum of three odds = odd. But 00 is even — contradiction.
  • pp even, qq odd. Then ap2a p^{2} is even, bpqb p q is even, cq2c q^{2} is odd (since cc odd and q2q^{2} odd). Sum: even+even+odd=odd\text{even} + \text{even} + \text{odd} = \text{odd}. Again odd, contradiction.
  • pp odd, qq even. Symmetric: ap2a p^{2} is odd, bpqb p q is even, cq2c q^{2} is even. Sum: odd. Contradiction.
  • Both pp and qq even is excluded by gcd(p,q)=1\gcd(p, q) = 1.

In every case the sum is odd, hence non-zero. So there is no rational root. The number of rational roots must be 00. This is option A.

Why the other options fail.

  • B, 11: would require exactly one rational root, but every case yields zero.
  • C, 22: as above.
  • D, ‘cannot be determined’: the answer is determined by the parity argument.

The lesson: parity arguments are powerful when coefficients are restricted to all odd. The key step is checking the three parity cases of (p,q)(p, q) (excluding both even by coprimality).