Opening subject page...
Loading your content
Master the algebraic structures and solution techniques that dominate GRE quantitative comparison and problem-solving questions.
The study of quadratic equations stretches back nearly four millennia, making it one of the oldest continuous threads in mathematical thought. Ancient Babylonian scribes carved cuneiform tablets describing procedures for finding unknown lengths and areas—problems that reduce, in modern notation, to solving expressions of the form ax² + bx + c = 0. The Greeks recast these numerical recipes into geometric language, while Islamic-era algebraists such as al-Khwārizmī unified the scattered methods into a coherent discipline they called al-jabr—the very word from which 'algebra' derives. Understanding this heritage illuminates why polynomials remain central to standardized assessments like the GRE: they represent the foundational language of quantitative reasoning.
On the GRE, quadratic and polynomial relationships appear in both Quantitative Comparison and Problem Solving formats. The central question these topics address is deceptively simple: given a polynomial expression or equation, how do we determine its roots, its behavior, and its relationship to other quantities? Mastering the answer equips you to handle a wide range of GRE algebra questions efficiently and confidently.
A polynomial is an expression of the form aₙxⁿ + aₙ₋₁xⁿ⁻¹ + … + a₁x + a₀, where the exponents are non-negative integers and the coefficients aₙ, aₙ₋₁, …, a₀ are real numbers. The degree of the polynomial is the highest power of x with a nonzero coefficient. A quadratic is simply a polynomial of degree 2. Four foundational ideas govern how these expressions behave on the GRE.
The graph of a quadratic function f(x) = ax² + bx + c is always a parabola. When a > 0 the parabola opens upward, and when a < 0 it opens downward. The vertex, the axis of symmetry, and the x-intercepts (roots) are the three features you should be able to identify at a glance. The diagram below plots two quadratics with different discriminant values to show how the number of real roots changes visually.
Notice that the discriminant (Δ = b² − 4ac) acts as a diagnostic: when Δ > 0 the parabola crosses the x-axis twice, when Δ = 0 it just touches (one repeated root), and when Δ < 0 the parabola floats entirely above or below the axis. GRE questions frequently test whether you can determine the number of real solutions without actually computing them, making the discriminant one of the most efficient tools in your repertoire.
For the GRE, the most frequently tested polynomial techniques beyond degree 2 are the Remainder Theorem and the Factor Theorem. The Remainder Theorem states that when a polynomial p(x) is divided by (x − r), the remainder equals p(r). The Factor Theorem is its corollary: (x − r) is a factor of p(x) if and only if p(r) = 0. Together, they allow rapid evaluation and factoring of cubic or quartic expressions that would otherwise be time-consuming.
On the GRE, you need a toolkit of solution methods, and knowing which tool to deploy is often more important than the execution itself. Below is a classification of solution strategies by efficiency and applicability, followed by a visual summary of how polynomial degree affects graph behavior.
| Method | Best For | Key Advantage |
|---|---|---|
| Factoring | Integer roots, simple coefficients | Fastest when applicable; no formula needed |
| Completing the Square | Converting to vertex form; deriving the quadratic formula | Reveals vertex (h, k) directly; useful for max/min problems |
| Quadratic Formula | Any quadratic, especially irrational or complex roots | Universal; discriminant immediately tells you the nature of roots |
| Substitution (u-sub) | Equations in quadratic form, e.g., x⁴ − 5x² + 4 = 0 | Reduces higher-degree equations to quadratics via u = x² |
| Factor / Remainder Theorem | Cubics and higher with at least one rational root | Synthetic division quickly isolates factors once one root is found |
A critical GRE insight: odd-degree polynomials (cubic, quintic, etc.) must cross the x-axis at least once because their end behaviors go in opposite directions (one end toward +∞, the other toward −∞). Even-degree polynomials (quadratic, quartic, etc.) can have zero real roots if the entire graph sits above or below the x-axis. This observation alone can eliminate answer choices in quantitative comparison problems.
Let us walk through a GRE-style problem that combines factoring, the discriminant, and Vieta's formulas—demonstrating how these tools work together under time pressure.
No single technique is optimal for every polynomial problem on the GRE. Choosing the right approach depends on the structure of the equation and the nature of the question. The following comparison highlights the trade-offs among the principal methods.
| Method | Strengths | Limitations |
|---|---|---|
| Factoring | Fast, elegant, and avoids arithmetic errors; works beautifully with integer roots and recognizable patterns (difference of squares, perfect square trinomials). | Fails when roots are irrational or complex; requires pattern recognition that can be unreliable under pressure. |
| Quadratic Formula | Universally applicable to any quadratic; discriminant immediately reveals the nature and count of roots. | Computation-heavy; easy to make sign errors with the ±, especially under GRE time constraints. |
| Completing the Square | Converts to vertex form; ideal for optimization (max/min) problems and graph-interpretation questions. | Slower than factoring for root-finding; fractions emerge when a ≠ 1. |
| Vieta's Formulas | Answers root-relationship questions (sum, product) without solving; extremely efficient for GRE Quantitative Comparison. | Does not produce individual root values; only useful when the question asks about aggregate root properties. |
While the GRE tests quadratic and polynomial relationships at a precalculus level, the concepts you are mastering form the backbone of more advanced mathematical theory. Recognizing these connections deepens your understanding and occasionally provides elegant shortcuts even at the GRE level.
| GRE-Level Concept | Advanced Extension |
|---|---|
| Discriminant Δ = b² − 4ac determines number of real roots | In algebraic geometry, the discriminant generalizes to detect singularities on curves and surfaces defined by polynomial equations. |
| Factoring p(x) into linear factors | The Fundamental Theorem of Algebra guarantees complete factorization over ℂ; Galois theory explains when factorization is expressible in radicals. |
| Vieta's formulas relating roots to coefficients | Symmetric polynomials and Newton's identities generalize Vieta's relationships to power sums of roots for degree-n polynomials. |
| Vertex form y = a(x − h)² + k for max/min | Optimization via completing the square is a precursor to calculus-based optimization (setting derivatives equal to zero). |
| Polynomial long division / synthetic division | Division algorithms extend to polynomial rings in abstract algebra, underpinning error-correcting codes and cryptographic protocols. |
For GRE preparation, the practical takeaway is that quadratic and polynomial relationships are not isolated tricks—they are instances of deep algebraic structure. Internalizing the factor-root duality and the discriminant as a classifier gives you a conceptual framework that transfers to virtually any GRE algebra or data interpretation problem involving polynomial expressions.
Quadratic and polynomial relationships form the algebraic backbone of the GRE Quantitative section. A polynomial of degree n has at most n real roots and n − 1 turning points. For quadratics (degree 2), the discriminant Δ = b² − 4ac instantly classifies the nature of the roots: two distinct real roots when Δ > 0, one repeated root when Δ = 0, and no real roots when Δ < 0. The three primary solution methods—factoring, the quadratic formula, and completing the square—each have distinct strengths that make them optimal for different problem structures.
Vieta's formulas (sum of roots = −b/a, product of roots = c/a) allow you to answer root-relationship questions without solving. For higher-degree polynomials, the Factor Theorem and Remainder Theorem enable systematic decomposition once a single root is identified. The factor-root duality—that (x − r) is a factor if and only if r is a root—is the single most powerful organizing principle for all polynomial questions on the GRE. Success on test day comes from rapid method selection: read the structure, pick the tool, execute efficiently.