12 multiple-choice questions, progressively harder.
The Rational Root Theorem applies to a polynomial P(x)=anxn+⋯+a1x+a0P(x) = a_n x^n + \cdots + a_1 x + a_0P(x)=anxn+⋯+a1x+a0 provided its coefficients are all what kind of numbers?
Solution
Correct answer: C
The theorem's hypothesis is that every coefficient is an integer. The proof clears denominators and then reasons about divisibility, which only makes sense for integers.
an,an−1,…,a0∈Za_n, a_{n-1}, \ldots, a_0 \in \mathbb{Z}an,an−1,…,a0∈Z
If an equation has fractional coefficients, multiply through by a common denominator first; the roots do not change, and the new polynomial has integer coefficients the theorem can read.
What is the complete list of possible rational roots that the theorem allows for x3−4x+2x^3 - 4x + 2x3−4x+2?
Correct answer: B
The leading coefficient is 111, so the denominator qqq must divide 111, forcing q=1q = 1q=1: every candidate is an integer. The numerator ppp must divide the constant term 222.
candidates: ±1, ±2\text{candidates: } \pm 1, \ \pm 2candidates: ±1, ±2
Fractions like ±12\pm\tfrac{1}{2}±21 are impossible here, because the leading coefficient 111 has no divisor other than 111.
What is the complete list of possible rational roots of 2x3+x−32x^3 + x - 32x3+x−3?
Correct answer: A
Numerators are divisors of the constant term −3-3−3, so p∈{1,3}p \in \{1, 3\}p∈{1,3}. Denominators are divisors of the leading coefficient 222, so q∈{1,2}q \in \{1, 2\}q∈{1,2}.
±11, ±31, ±12, ±32\pm\tfrac{1}{1}, \ \pm\tfrac{3}{1}, \ \pm\tfrac{1}{2}, \ \pm\tfrac{3}{2}±11, ±13, ±21, ±23
That is the eight-number list ±1,±3,±12,±32\pm 1, \pm 3, \pm\tfrac{1}{2}, \pm\tfrac{3}{2}±1,±3,±21,±23.
According to the theorem, which of these numbers CANNOT be a root of 3x3−7x+10=03x^3 - 7x + 10 = 03x3−7x+10=0?
A rational root pq\tfrac{p}{q}qp in lowest terms needs p∣10p \mid 10p∣10, so p∈{1,2,5,10}p \in \{1, 2, 5, 10\}p∈{1,2,5,10}, and q∣3q \mid 3q∣3, so q∈{1,3}q \in \{1, 3\}q∈{1,3}.
32 fails both tests: 3∤10 and 2∤3\tfrac{3}{2}\text{ fails both tests: } 3 \nmid 10 \text{ and } 2 \nmid 323 fails both tests: 3∤10 and 2∤3
Each of 53\tfrac{5}{3}35, −10-10−10, and 23\tfrac{2}{3}32 passes the divisibility test, so the theorem cannot rule them out (passing still does not make them roots).
Test the candidate x=−1x = -1x=−1 in P(x)=x3+2x2−5x−6P(x) = x^3 + 2x^2 - 5x - 6P(x)=x3+2x2−5x−6. What do you find?
Substitute x=−1x = -1x=−1, keeping track of signs: (−1)3=−1(-1)^3 = -1(−1)3=−1 and (−1)2=1(-1)^2 = 1(−1)2=1.
P(−1)=−1+2+5−6=0P(-1) = -1 + 2 + 5 - 6 = 0P(−1)=−1+2+5−6=0
So −1-1−1 is a root. (Dividing by x+1x + 1x+1 gives x2+x−6=(x+3)(x−2)x^2 + x - 6 = (x + 3)(x - 2)x2+x−6=(x+3)(x−2), so the other roots are −3-3−3 and 222.)
A polynomial with integer coefficients is monic (leading coefficient 111). What does the theorem say about its rational roots?
For a rational root pq\tfrac{p}{q}qp in lowest terms, the denominator must divide the leading coefficient. Here that coefficient is 111.
q∣1 ⇒ q=1q \mid 1 \;\Rightarrow\; q = 1q∣1⇒q=1
So every rational root is an integer ppp, and ppp divides the constant term. The theorem never guarantees that any rational root exists; it only restricts where one could be.
The candidate list for x2+3x+2x^2 + 3x + 2x2+3x+2 is ±1,±2\pm 1, \pm 2±1,±2. Which candidates are actual roots?
Factor the quadratic.
x2+3x+2=(x+1)(x+2)x^2 + 3x + 2 = (x + 1)(x + 2)x2+3x+2=(x+1)(x+2)
The roots are x=−1x = -1x=−1 and x=−2x = -2x=−2. Both sit on the candidate list, as the theorem requires, while the positive candidates 111 and 222 fail: every coefficient is positive, so no positive number can be a root.
For P(x)=4x3+3x−9P(x) = 4x^3 + 3x - 9P(x)=4x3+3x−9, which denominators qqq can appear in a rational root pq\tfrac{p}{q}qp written in lowest terms?
Correct answer: D
The denominator of a rational root must divide the leading coefficient 444.
q∈{1,2,4}q \in \{1, 2, 4\}q∈{1,2,4}
The divisors of 999 are the possible numerators, not denominators; mixing the two roles up is the classic error.
For the same polynomial P(x)=4x3+3x−9P(x) = 4x^3 + 3x - 9P(x)=4x3+3x−9, which numerators ppp are possible, up to sign?
The numerator of a rational root must divide the constant term −9-9−9, and divisibility ignores the sign.
p∈{1,3,9}p \in \{1, 3, 9\}p∈{1,3,9}
Combining with q∈{1,2,4}q \in \{1, 2, 4\}q∈{1,2,4} gives the full candidate list ±1,±3,±9,±12,±32,±92,±14,±34,±94\pm 1, \pm 3, \pm 9, \pm\tfrac{1}{2}, \pm\tfrac{3}{2}, \pm\tfrac{9}{2}, \pm\tfrac{1}{4}, \pm\tfrac{3}{4}, \pm\tfrac{9}{4}±1,±3,±9,±21,±23,±29,±41,±43,±49.
The theorem lists ±1,±2,±4\pm 1, \pm 2, \pm 4±1,±2,±4 as the possible rational roots of some polynomial. What is guaranteed?
The theorem is a one-way implication: a rational root must appear on the list.
rational root ⇒ on the list\text{rational root} \;\Rightarrow\; \text{on the list}rational root⇒on the list
Nothing runs backwards. The polynomial may have three rational roots, one, or none at all; only testing the candidates can tell.
What is the complete list of possible rational roots of 5x2−45x^2 - 45x2−4?
Numerators divide the constant term −4-4−4, so p∈{1,2,4}p \in \{1, 2, 4\}p∈{1,2,4}; denominators divide the leading coefficient 555, so q∈{1,5}q \in \{1, 5\}q∈{1,5}.
±1, ±2, ±4, ±15, ±25, ±45\pm 1, \ \pm 2, \ \pm 4, \ \pm\tfrac{1}{5}, \ \pm\tfrac{2}{5}, \ \pm\tfrac{4}{5}±1, ±2, ±4, ±51, ±52, ±54
The second option is the flipped-fraction trap: it uses divisors of the leading coefficient as numerators.
You test a candidate ccc and find P(c)=0P(c) = 0P(c)=0. Which theorem then guarantees that x−cx - cx−c is a factor of P(x)P(x)P(x)?
The Factor Theorem makes the conversion from root to factor.
P(c)=0 ⟺ (x−c) divides P(x)P(c) = 0 \;\Longleftrightarrow\; (x - c) \text{ divides } P(x)P(c)=0⟺(x−c) divides P(x)
The Rational Root Theorem only supplies the candidates worth testing; the Factor Theorem is what turns a successful test into a factorization step.
Reset this practice set?
This clears every answer you have given and starts the set again from question 1.