299 core topics
+ 45 prerequisite topics taught
as needed · approximately 102 hours of instruction
including spaced review
An adaptive diagnostic (up to
40 questions) places the student on the course's knowledge
graph - topics already known are credited, and instruction begins exactly
at the learning frontier. Every topic is taught with a worked-example
lesson and auto-graded practice; a topic is mastered at
75%+ and then maintained through spaced reviews on an
expanding schedule. Mixed checks follow every 6 lessons;
each unit ends with a 12-item quiz, and course-wide assessments appear at
25%, 50%, 75%, and 100% mastery. Prerequisite gaps below the course are detected and taught rather
than skipped, so completion certifies the whole tower, not just the top.
| Two-Step Inequalities with the Flip
[E] |
Undo the constant, then divide - and flip the sign if the divisor is negative. |
| Multi-Step Inequalities
[M] |
Distribute and collect variables just like an equation - then mind the sign. |
| Which Way Does the Sign Point?
[E] |
Spot when the inequality flips - and when it doesn't. |
| Compound AND Inequalities
[M] |
A sandwiched inequality: do the same steps to all three parts. |
| Compound OR Inequalities
[M] |
OR keeps everything either piece allows - only the gap between them fails. |
| Absolute Value: Less Than
[M] |
|x − m| < k traps x within k of m - an AND sandwich. |
| Absolute Value: Greater Than
[M] |
|x − m| > k pushes x farther than k from m - an OR split. |
| Multi-Step Absolute Value Inequalities
[H] |
Isolate the absolute value first; only then split into a sandwich. |
| At Least / At Most Word Problems
[M] |
Translate a budget or goal into an inequality, then round the smart way. |
| Hitting an Average Target
[M] |
An average of at least T means the total must reach n times T. |
| Translating Words into Inequalities
[E] |
At most means ≤, at least means ≥, more than means > - order matters too. |
| Checking Points Against a System
[M] |
Substitute the point into each inequality and judge them separately. |
| All Real Numbers or No Solution?
[M] |
When the x-terms cancel, only a true-or-false number fact remains. |
| Evaluating Exponential Functions
[E] |
Plug integer inputs into f(x) = a·bˣ - including 0 and negatives. |
| Growth Rates & Growth Factors
[E] |
Growing r% per step means multiplying by 1 + r/100 each step. |
| Decay Rates & Decay Factors
[E] |
Losing r% per step means multiplying by 1 − r/100 each step. |
| Modeling Percent Growth & Decay
[M] |
Turn a percent rate into a factor, then multiply once per time step. |
| Doubling Contexts
[M] |
Doubling every period is y = a·2ᵗ with t counting periods, not hours. |
| Halving & Half-Life
[M] |
Halving every period is y = a·(1/2)ᵗ - count the halvings first. |
| Exponential Patterns in Tables
[M] |
Equal steps in x: equal differences mean linear, equal ratios mean exponential. |
| Graphs of Exponential Functions
[M] |
y-intercept a, growth when b > 1, decay when 0 < b < 1, floor at y = 0. |
| Linear vs. Exponential Growth
[M] |
A linear head start never survives repeated doubling. |
| Simple vs. Compound Interest
[H] |
Simple interest grows linearly; compounding earns interest on interest. |
| Same-Base Exponential Equations
[M] |
Match the bases, then set the exponents equal. |
| Exponential Equations with a Base Change
[H] |
Rewrite both sides over one common base before equating exponents. |
| Computing the Mean
[E] |
The mean is the total shared out equally - and totals work backwards too. |
| Median & Mode
[E] |
Sort first: the median is the middle, the mode is the most frequent. |
| Outliers and the Mean
[M] |
One extreme value drags the mean toward it; the median barely moves. |
| Choosing a Measure of Center
[E] |
Skewed or outlier-heavy data wants the median; symmetric data, the mean. |
| Mean Absolute Deviation
[M] |
MAD is the average distance of the data from its own mean. |
| Variance of a Data Set
[M] |
Square each deviation from the mean, then average the squares. |
| The Five-Number Summary
[M] |
Min, Q1, median, Q3, max - five landmarks that sketch a whole data set. |
| Range, IQR & the Outlier Fence
[M] |
The IQR measures the spread of the middle half - and builds the outlier fence. |
| Reading Box Plots
[M] |
Each piece of a box plot - whisker, half-box, half-box, whisker - holds about 25% of the data. |
| Two-Way Relative Frequency
[M] |
Percent of what? The denominator - a row, a column, or everyone - changes the answer. |
| Interpreting a Fitted Line
[M] |
Slope is the predicted change per unit of x; the intercept is the prediction at x = 0. |
| Residuals
[M] |
A residual is actual minus predicted - the line's miss at one point. |
| Correlation vs. Causation
[E] |
Association alone never proves cause - look for lurking variables or a randomized experiment. |
| Polynomial Sums: Hunting a Coefficient
[E] |
Add or subtract polynomials and report one requested coefficient. |
| Monomial Times a Polynomial
[E] |
Distribute a single term across a trinomial and read off a coefficient. |
| Binomial Products: Any Term You Like
[M] |
Expand (ax+b)(cx+d) and pick out the leading, middle, or constant term. |
| Binomial Times a Trinomial
[M] |
Expand a binomial against a trinomial and locate a single term. |
| Squaring a Binomial
[M] |
Apply (ax±b)² = a²x² ± 2abx + b² and read a coefficient. |
| The Sum-Times-Difference Product
[M] |
Recognize (ax+b)(ax−b) = a²x² − b² - the middle term vanishes. |
| GCF Factoring: the Leftover Trinomial
[M] |
Pull out the greatest common factor and inspect the quotient's coefficients. |
| Factoring x² + bx + c to a Factor
[M] |
Split a monic trinomial and hand back one exact binomial factor. |
| Factoring by Grouping
[H] |
Group a four-term polynomial and extract the shared binomial factor. |
| Factoring a Difference of Squares
[M] |
Reverse a²x² − b² into the sum and difference of its square roots. |
| Perfect-Square Trinomials
[M] |
Recognize a²x² ± 2abx + b² and write it as a single squared binomial. |
| Factoring ax² + bx + c with a > 1
[H] |
Factor a trinomial with a leading coefficient above 1 and return a factor. |
| Evaluating a Quadratic Function
[E] |
Substitute a number for x and simplify to get the function's output. |
| The Vertex: x = −b/(2a)
[M] |
The turning point's x-coordinate comes straight from a and b. |
| The Vertex y-value
[M] |
Plug the vertex's x back into the function to get its y. |
| The Axis of Symmetry
[E] |
The vertical mirror line runs midway between the two x-intercepts. |
| The y-Intercept of a Quadratic
[E] |
A parabola meets the y-axis at its constant term c. |
| x-Intercepts by Factoring
[M] |
The graph crosses the x-axis where each factor is zero. |
| Maximum or Minimum Value
[M] |
The vertex's y-value is the largest or smallest output the function reaches. |
| Does It Open Up or Down?
[E] |
The sign of the leading coefficient decides maximum versus minimum. |
| Transformations of y = x²
[M] |
Shifting y = x² moves the vertex from the origin by the shift amounts. |
| Reading a Shift from Vertex Form
[M] |
Vertex form spells out exactly how the parent parabola was moved. |
| Projectile Motion: Time of Peak
[M] |
A launched object peaks at the vertex time t = v/32. |
| Projectile Motion: Height at a Time
[M] |
Evaluate the height model at a given instant. |
| Comparing Two Parabolas
[M] |
Read vertex form to compare position, width, and extreme value. |
| Arithmetic Sequences: Any Term
[M] |
Reach a distant term, find a term's position, or recover the common difference. |
| Modeling with Arithmetic Sequences
[M] |
Fixed steps up or down are arithmetic - translate the story into a₁ and d. |
| Geometric Sequences: Any Term
[M] |
Multiply, don't add: the nth term uses a whole-number ratio raised to n − 1. |
| Modeling with Geometric Sequences
[M] |
Repeated multiplying - doubling, tripling - is geometric growth. |
| Recursive vs. Explicit Rules
[M] |
A recursive rule leans on the previous term; an explicit rule jumps straight to term n. |
| Building Terms from a Recursive Rule
[M] |
March one term at a time - even when no explicit shortcut exists. |
| Joint Relative Frequency
[M] |
A joint relative frequency is one inner cell divided by the grand total. |
| Marginal Relative Frequency
[M] |
A marginal relative frequency uses a whole row or column total over the grand total. |
| Theoretical Probability of Simple Events
[M] |
Favorable outcomes over equally likely total outcomes, reduced to lowest terms. |
| Probability of Compound Events
[M] |
Multiply for independent 'and'; add for non-overlapping 'or'. |
| Experimental Probability from Data
[M] |
Count what actually happened over the number of trials - then predict. |
| Using a Data Display
[E] |
Read the graph, then combine the values the question actually asks about. |
| Correlation vs. Causation
[E] |
Association is not proof of cause - hunt for a lurking variable or a random assignment. |
| Point-Slope Form
[H] |
One point plus the slope pins down a line: y - y1 = m(x - x1). |
| Standard Form to Slope-Intercept
[H] |
Solve Ax + By = C for y to expose the slope and the y-intercept. |
| Slope-Intercept to Standard Form
[H] |
Move the x-term next to y and clear any fractions to get Ax + By = C. |
| Intercepts from Standard Form
[H] |
Set y = 0 for the x-intercept and x = 0 for the y-intercept. |
| Parallel & Perpendicular Slopes
[H] |
Parallel lines share a slope; perpendicular slopes are negative reciprocals. |
| A Line Through a Point, Parallel or Perpendicular
[H] |
Borrow the slope (or its negative reciprocal), then solve for b. |
| A Linear Rule from a Table
[H] |
The slope is change in y over change in x; then back up to find b. |
| Linear Cost Models & Break-Even
[H] |
Cost = fixed fee + rate times amount; set two plans equal to compare. |
| Slope from a Graph
[H] |
Read rise over run between two labeled points, sign included. |
| Elimination with Multiplication
[H] |
Scale one or both equations so a variable's coefficients cancel. |
| One, None, or Infinitely Many?
[H] |
Compare slopes and intercepts: the three cases of a linear system. |
| Forcing a Special System
[H] |
Match the coefficient ratios to make a system dependent or inconsistent. |
| Wind & Current Problems
[H] |
With and against speeds are s + c and s - c: a built-in system. |
| Substitution with y Already Solved
[H] |
Drop the expression for y straight into the other equation. |
| An Exponential from Two Points
[H] |
Divide function values to isolate a power of b, then peel back to a. |
| When Exponential Overtakes Linear
[H] |
Doubling eventually beats any steady rate: find the exact crossover. |
| Repeated Fractional Decay
[H] |
Losing 1/3 each step means multiplying by 2/3 each step. |
| Linear or Exponential? Reading a Table
[H] |
Equal differences say linear; equal ratios say exponential. |
| Quadratics with Rational Roots
[H] |
Factor or use the formula; a leading coefficient makes fraction roots. |
| Converting to Vertex Form
[H] |
Complete the square: half the x-coefficient, square it, rebalance. |
| Writing a Quadratic from Its Zeros
[H] |
Zeros p and q give factors (x - p)(x - q); a y-intercept fixes the stretch. |
| Projectile Motion: Landing Time
[H] |
Set h = 0 and factor; keep only the positive time. |
| Area Problems that Become Quadratics
[H] |
Let w be the width, write length in terms of w, and set w times length equal to the area. |
| Factoring Completely
[H] |
Pull the GCF first, then factor what remains all the way down. |
| Partner Points Across the Axis
[H] |
Equal heights sit symmetrically: the partner of x is 2h - x. |
| Radicals as Rational Exponents
[H] |
The root index goes in the denominator; the power goes in the numerator. |
| Evaluating Rational Exponents
[H] |
Root first, then power; a negative exponent means reciprocal. |
| Rationalizing a Denominator
[H] |
Multiply top and bottom by the radical to clear it from below. |
| Radical Equations & Extraneous Roots
[H] |
Squaring can invent solutions: always check each root in the original. |
| An Arithmetic Rule from Two Terms
[H] |
The difference of two terms spread over their index gap gives d. |
| A Geometric Rule from Two Terms
[H] |
The ratio of terms two apart is r squared; take the positive root. |
| Arithmetic, Geometric, or Neither?
[H] |
Test differences first, then ratios; both must hold at EVERY step. |
| Two-Step Absolute Value Equations
[H] |
Isolate the absolute value first, then split into two cases. |
| Absolute Value as Tolerance
[H] |
|x - c| <= t means: within t of the target c, both directions. |
| The Vertex of an Absolute Value Graph
[H] |
y = a|x - h| + k is a V with corner (h, k); the sign of a points it. |
| Nested Function Evaluation
[H] |
Work inside out: evaluate the inner function, feed it to the outer. |
| A Domain that Fits the Context
[H] |
The story limits the inputs: counts are whole, measures are real, both are bounded. |
| Range over a Finite Domain
[H] |
Evaluate at every allowed input; the range is those outputs. |
| Domain & Range from a Graph
[H] |
Domain is the shadow on the x-axis; range is the shadow on the y-axis. |
| Predicting with a Line of Fit
[H] |
Find the fit line's slope from two points, then ride it to the target. |
| Comparing Correlation Strength
[M] |
Strength lives in |r|; the sign only gives the direction. |
| The x-Intercept of a Line
[H] |
Set y = 0 and solve; from two points, find the slope first. |
| Clearing an Equation of Fractions
[H] |
Multiplying every term by the least common denominator turns a fractional equation into an integer one. |
| Fractional Coefficients on Both Sides
[H] |
Collect fractional x-terms on one side by subtracting the smaller coefficient, or clear all denominators first. |
| Equations with Decimal Coefficients
[H] |
Multiplying every term by a power of ten clears decimals the way an LCD clears fractions. |
| Distributing a Fraction over a Binomial
[H] |
A fraction in front of parentheses multiplies BOTH terms inside before any collecting happens. |
| Equations with Nested Grouping
[H] |
Simplify the innermost grouping first, then distribute the outer factor across every term it produced. |
| Proportions with Binomial Parts
[H] |
Cross-multiplying a proportion multiplies each numerator by the other denominator, parentheses included. |
| One Solution, None, or Every Number?
[H] |
Compare the simplified x-coefficients: unequal gives one solution, equal gives none or all depending on the constants. |
| The Coefficient That Removes Every Solution
[H] |
An equation is contradictory exactly when the x-terms match but the constants do not. |
| The Constant That Makes an Identity
[H] |
An identity needs the simplified sides to agree in the x-term and in the constant term. |
| A Literal Equation with x on Both Sides
[H] |
Gather every term containing the target variable on one side, factor it out, and divide by the resulting factor. |
| Rearranging a Formula That Has a Fraction
[H] |
Clear the fraction by multiplying both sides by its denominator before the target variable is isolated. |
| Solving for a Variable in a Denominator
[H] |
Multiply both sides by the denominator first; if the target then appears twice, factor it out. |
| Rearrange First, Then Substitute
[H] |
Isolating the wanted variable symbolically before substituting keeps the arithmetic to a single evaluation. |
| Finding the First Incorrect Step
[H] |
A rearrangement step is valid only when the same operation is applied to every term on both sides. |
| A Three-Part Inequality That Reverses
[H] |
Dividing all three parts of a sandwich inequality by a negative number reverses both inequality signs. |
| When Every Part Contains the Variable
[H] |
A sandwich with x in all three parts must be split into two separate inequalities and the two solution sets intersected. |
| OR Statements That Need a Sign Flip
[H] |
Each piece of an OR statement is solved on its own, and a negative coefficient reverses only that piece's sign. |
| Sandwich Inequalities with Fractional Bounds
[H] |
Multiplying all three parts by a positive denominator clears a fraction without disturbing either inequality sign. |
| Compound Statements with No or Every Solution
[H] |
An AND of disjoint pieces has no solution, while an OR of overlapping pieces admits every real number. |
| Isolating an Absolute Value with a Coefficient on x
[H] |
Undo everything outside the bars first, then split into two cases and divide by the coefficient of x. |
| Counting the Solutions of an Absolute Value Equation
[H] |
Once the bars are alone, a positive right side gives two solutions, zero gives one, and a negative right side gives none. |
| Absolute Value on Both Sides
[H] |
Two absolute values are equal when the insides are equal or exact opposites, giving two equations to solve. |
| Absolute Value Equations with a Variable Outside the Bars
[H] |
A candidate is genuine only if it makes the expression outside the bars greater than or equal to zero. |
| Absolute Value Inequalities with a Coefficient on x
[H] |
A less-than absolute value inequality becomes the sandwich from negative t to t, which is then solved for x in all three parts. |
| Absolute Value Inequalities That Are Always or Never True
[H] |
Comparing an absolute value to a negative number settles the inequality without any casework. |
| Finding a System's Solution in a Table
[H] |
The solution of a system is the input at which both equations return the same output. |
| Where Two Graphed Lines Cross
[H] |
Graphing solves a system by locating the single point that lies on both lines. |
| Substitution After Isolating a Variable
[H] |
Isolate the variable whose coefficient is 1 or -1, then substitute that expression into the other equation. |
| Systems Whose Solution Is Not an Integer
[H] |
Elimination produces the exact fractional coordinates when no coefficient divides evenly. |
| Elimination After Clearing Fractions and Decimals
[H] |
Scaling each equation by its own least common denominator makes the coefficients integers before elimination begins. |
| Choosing an Efficient Method
[H] |
The coefficients decide the method: an isolated variable favors substitution, matching or opposite coefficients favor elimination. |
| Answering a System with One Combination
[H] |
Adding or subtracting two equations can deliver the requested combination of x and y without solving for either one. |
| Recovering a Coefficient from a Known Solution
[H] |
A known solution turns an unknown coefficient into a one-variable equation by substitution. |
| What Elimination Leaves Behind
[H] |
When elimination erases both variables, a true remainder means infinitely many solutions and a false one means none. |
| A Second Point on a Dependent System
[H] |
A dependent system's solutions are the points of one shared line, so either coordinate determines the other. |
| Mixing Two Solutions to a Target Strength
[H] |
A mixture gives two equations: total volume and total amount of the dissolved substance. |
| A Trip Split Between Two Speeds
[H] |
Total time and total distance give two equations in the two unknown times. |
| Splitting Money Between Two Rates
[H] |
The principals add to the total invested while rate times principal adds to the total interest. |
| Two Prices Recovered from Two Sales
[H] |
Two purchases of the same two items give two equations whose unknowns are the prices, not the counts. |
| The Break-Even Count
[H] |
Break-even is the number of units at which the revenue equation and the cost equation give the same total. |
| A Corner of the Feasible Region
[H] |
Each corner of a feasible region is the intersection of two boundary lines, found by solving them as a system of equations. |
| The Best Corner of a Feasible Region
[H] |
A linear objective on a bounded feasible region attains its extreme value at one of the corners, so every corner must be tested. |
| Counting Whole-Number Points in a Region
[H] |
Counting lattice points in a feasible region means counting, for each allowed x, the whole-number values of y that fit. |
| Boundary Style and the Shaded Side
[H] |
A strict inequality draws a dashed boundary, and the shaded side is decided after the inequality is solved for y. |
| Evaluating a Function at an Expression
[H] |
Substituting an expression for x works exactly as substituting a number: replace every x, then simplify. |
| The Rule for a Composition
[H] |
To build f(g(x)), substitute the whole rule for g in place of every x in f. |
| Order Inside a Composition
[H] |
Composition is not commutative: f(g(a)) and g(f(a)) are usually different numbers. |
| Solving an Equation Built from a Composition
[H] |
Undo a composition from the outside in: strip the outer function first, then the inner one. |
| Composition from Two Tables
[H] |
Read the inner output from its column, then look that number up as the next input. |
| Net Change Written in Function Notation
[H] |
The expression f(b) - f(a) is the total change in output between the two inputs. |
| Chaining Two Models in Context
[H] |
When one model's output is the next model's input, compose them and keep the units in order. |
| Domain and Range as Intervals from a Graph
[H] |
The domain is the span of x-values covered; the range is the span of y-values reached. |
| Counting the Range from a Table
[H] |
The range is the SET of outputs, so a repeated output is listed only once. |
| Output Extremes over a Restricted Domain
[H] |
On a restricted domain the extreme outputs come from testing the whole allowed input set. |
| Where a Graph Lies Above or Below the Axis
[H] |
A graph is above the x-axis exactly where its output is positive, and below it where the output is negative. |
| The Range of an Absolute Value Function
[H] |
An absolute value graph turns at its vertex, so its range starts or stops at the vertex y-value. |
| Average Rate of Change from a Table
[H] |
Average rate of change is the change in output divided by the change in input over the same interval. |
| Comparing Average Rates over Several Intervals
[H] |
Compare intervals by computing every rate, since a large change over a long interval can still be slow. |
| Interpreting an Average Rate of Change
[H] |
An average rate of change carries output units per input unit and says how fast the output changed on average. |
| Recovering a Value from an Average Rate
[H] |
Change in output equals the average rate times the change in input, so a known rate recovers a missing value. |
| Evaluating a Piecewise Function
[H] |
Choose the piece whose condition the input satisfies, then evaluate only that piece. |
| Which Piece Owns the Boundary
[H] |
At a boundary input, only the piece whose inequality includes that number applies. |
| Solving a Piecewise Equation
[H] |
Solve each piece separately and keep only the roots that lie inside that piece's own condition. |
| Three-Tier Rate Models
[H] |
In a tiered rate each block of usage is charged at its own price, so the total is a sum of completed tiers plus the partial one. |
| Step Functions in Context
[H] |
A step charge rounds a partial period up to a whole one, so the cost jumps at each boundary. |
| Reading a Value off a Piecewise Graph
[H] |
On a piecewise linear graph, find the segment containing the input and follow that segment's constant slope. |
| Describing a Transformation of y = |x|
[H] |
In y = a|x - h| + k the value h shifts the graph horizontally, k shifts it vertically, and a stretches or reflects it. |
| Writing an Absolute Value Rule from a Description
[H] |
Translate each described move into its parameter: horizontal shifts change h, vertical shifts change k, stretches and reflections change a. |
| Evaluating a Transformed Absolute Value Rule
[H] |
Evaluate the inside of the bars first, take the absolute value, then apply the outside multiplier and constant. |
| The Image of a Point Under a Transformation
[H] |
Under y = a|x - h| + k a point (p, q) of the parent graph moves to (p + h, aq + k). |
| x-Intercepts of an Absolute Value Graph
[H] |
Setting a|x - h| + k = 0 gives |x - h| = -k/a, which has two, one, or no solutions depending on that value's sign. |
| Shifting a Line Horizontally and Vertically
[H] |
Replacing x by x - h slides a line right h units, which changes its intercept but never its slope. |
| Reflecting a Line Across an Axis
[H] |
The rule -f(x) reflects a graph across the x-axis, while f(-x) reflects it across the y-axis. |
| From an Explicit Rule to a Recursive Rule
[H] |
An explicit rule names its first term and its step, which are exactly the two parts of the recursive rule. |
| A Distant Term from a Recursive Rule
[H] |
Convert a recursive rule to its explicit form to jump straight to a distant term. |
| Which Term Has a Given Value
[H] |
Setting the nth-term rule equal to a value and solving for n identifies the term's position. |
| Geometric Sequences with a Fractional Ratio
[H] |
A common ratio between 0 and 1 shrinks the terms, and the nth term is the first term times the ratio to the (n - 1) power. |
| Sequences with an Alternating Sign
[H] |
A negative common ratio flips the sign at every step, so odd and even positions carry opposite signs. |
| Inserting the Missing Terms Between Two Terms
[H] |
Count the gaps between the known terms: an arithmetic sequence splits the difference evenly, a geometric one splits the ratio into equal factors. |
| Writing a Recursive Rule from a List
[H] |
Test consecutive terms for a common difference or a common ratio, then state the first term with the operation that produces the next. |
| Writing an Exponential Model from a Story
[H] |
An exponential model is y = a b^t, where a is the starting amount and b is the factor applied once per time period. |
| Interpreting the Initial Value and the Growth Factor
[H] |
In y = a b^t the coefficient a is the amount at time zero and b is the fraction of the previous amount kept each period. |
| Recovering the Initial Value of a Model
[H] |
Since a later value equals a times b^t, dividing that value by b^t recovers the initial amount a. |
| Percent Change over Several Periods
[H] |
Percent changes compound rather than add, so multiply the factors and convert the product back to a percent. |
| Models Whose Period Is Not One Time Unit
[H] |
When a factor applies once every k time units, the number of factors is the elapsed time divided by k. |
| Comparing Several Models at One Instant
[H] |
At a specified time the winner is decided by evaluating every model, since a larger base can still trail a larger starting amount. |
| The First Whole Period Past a Threshold
[H] |
Tabulate the model period by period and stop at the first whole time value that crosses the threshold. |
| Average Rates: Linear against Exponential
[H] |
A linear function has the same average rate of change on every interval, while an exponential function's rate grows as the interval moves right. |
| The Gap Between Linear and Exponential Growth
[H] |
Evaluate both models at the same time and subtract to measure how far apart linear and exponential growth have moved. |
| Choosing Between a Linear and an Exponential Model
[H] |
Repeated addition of a fixed amount is linear; repeated multiplication by a fixed factor is exponential. |
| Degree and Standard Form
[H] |
The degree is the largest exponent, or in two variables the largest sum of exponents in a single term. |
| Subtracting a Polynomial in Full
[H] |
A subtraction sign in front of a polynomial changes the sign of every term inside it, not only the first. |
| Perimeter and Area as Polynomials
[H] |
Adding polynomial side lengths gives a perimeter; multiplying two of them gives an area. |
| Expanding Three Binomials
[H] |
Multiply two binomials first, then distribute the third across the resulting trinomial. |
| Squaring a Two-Variable Binomial
[H] |
(ax + by)squared equals a squared x squared plus 2abxy plus b squared y squared, so the middle term is twice the product of the two parts. |
| Difference of Squares in Arithmetic
[H] |
Two numbers equally far from a round number multiply to that round number squared minus the offset squared. |
| Differences of Squares, Higher Powers
[H] |
Any expression of the form A squared minus B squared factors as (A - B)(A + B), even when A or B carries a power or a second variable. |
| Telling Special Products Apart
[H] |
A sum times a difference loses its middle term, while a squared binomial keeps a middle term equal to twice the product of its parts. |
| The Missing Middle Term
[H] |
In a perfect-square trinomial the middle coefficient is twice the product of the square roots of the two end terms. |
| The GCF of Several Monomials
[H] |
The GCF of monomials pairs the greatest common divisor of the coefficients with the smallest exponent each variable carries. |
| Factoring Out a Negative Common Factor
[H] |
Pulling out a negative common factor changes the sign of every term that remains inside the parentheses. |
| A Common Binomial Factor
[H] |
A whole binomial can serve as the common factor, and reversing the order inside a binomial costs one factor of -1. |
| A Missing Dimension from an Area
[H] |
Dividing a polynomial area by one side length means factoring that side out of the area. |
| Factoring Trinomials in Two Variables
[H] |
A trinomial in x and y factors by the same reasoning as one in x alone, with y attached to the constant part of each binomial. |
| The ac-Method: Splitting the Middle Term
[H] |
To factor ax squared plus bx plus c, find two integers whose product is ac and whose sum is b, then use them to split the middle term. |
| Factorable or Prime?
[H] |
A trinomial splits into binomials with integer coefficients only when b squared minus 4ac is a perfect square. |
| Constants That Make a Trinomial Factor
[H] |
x squared plus bx plus c factors over the integers exactly when b and c come from a pair of integers with sum b and product c. |
| Factoring a Negative Leading Term
[H] |
Factor -1 (with any common factor) out of a trinomial that leads with a negative term, then factor the positive trinomial that remains. |
| Quartics in Quadratic Form
[H] |
A polynomial in x to the fourth, x squared and a constant factors like a trinomial in x squared, and each resulting factor may split again. |
| Grouping After Rearranging
[H] |
Four terms can be reordered before grouping so that each pair shares a common factor. |
| Grouping with a Negative Second Pair
[H] |
When the third and fourth terms are negative, factor a negative number out of the second pair so both pairs leave the same binomial. |
| Solutions from a Factored Equation
[H] |
A product equals zero exactly when one of its factors equals zero, and a constant factor contributes no solution. |
| Set It Equal to Zero First
[H] |
The zero-product property applies only after every term is moved to one side so the other side is zero. |
| Quadratics with Zero as a Solution
[H] |
When a quadratic has no constant term, factoring out x shows that zero is one of its two solutions. |
| Cubics Solved by Factoring
[H] |
A cubic that factors into three linear factors has one solution for each factor, found by the zero-product property. |
| Sum and Product of the Roots
[H] |
For ax squared plus bx plus c equal to zero, the solutions add to -b/a and multiply to c/a. |
| Solving a Squared Binomial
[H] |
Isolate the squared binomial, take both square roots, and then solve the two resulting linear equations. |
| Counting Solutions Before Solving
[H] |
Once a squared binomial is isolated, the sign of the number it equals decides whether there are two, one, or no real solutions. |
| The Number That Completes the Square
[H] |
x squared plus bx becomes a perfect square when (b/2) squared is added. |
| The Rewritten Completing-Square Step
[H] |
Completing the square rewrites a quadratic equation as (x + h) squared equal to k, with h half the x-coefficient and k whatever the balancing leaves. |
| Completing the Square with a Stretch
[H] |
When the leading coefficient is not 1, factor it out of the x-terms before completing the square inside the parentheses. |
| Exact Roots from the Formula
[H] |
The quadratic formula returns exact roots, which are simplified by reducing the radical and then dividing out any common factor. |
| Rational, Irrational, or Non-Real
[H] |
A positive perfect-square discriminant gives two rational solutions, a positive non-square gives two irrational ones, zero gives one repeated solution, and a negative gives none. |
| Forcing a Repeated Solution
[H] |
A quadratic has exactly one real solution when its discriminant is zero, which is one equation in the unknown coefficient. |
| Choosing a Solution Method
[H] |
The structure of a quadratic decides the efficient method: no linear term invites square roots, a perfect-square discriminant invites factoring, and anything else needs the formula. |
| Vertex Form from a Vertex and a Point
[H] |
The vertex fixes h and k, and one more point on the parabola determines the stretch factor a. |
| An Axis from Two Equal Outputs
[H] |
Two inputs with the same output sit symmetrically about the axis, so the axis is their midpoint. |
| The Vertex of Intercept Form
[H] |
In f(x) = a(x - p)(x - q) the vertex sits above or below the midpoint of the two x-intercepts. |
| The Range of a Quadratic Function
[H] |
A parabola's range starts at its vertex y-value and runs upward when it opens up or downward when it opens down. |
| Increasing and Decreasing Intervals
[H] |
A parabola changes direction only at its vertex, so an interval that avoids the vertex is entirely increasing or entirely decreasing. |
| Average Rate of Change of a Quadratic
[H] |
The average rate of change over an interval is the slope of the line joining the two endpoints of the graph. |
| Vertex Form Back to Standard Form
[H] |
Expanding a(x - h) squared plus k gives ax squared minus 2ahx plus ah squared plus k. |
| Projectile Motion: Maximum Height
[H] |
A projectile's greatest height is the y-value of the vertex of its height model, reached at time t = v/32. |
| Reaching a Given Height
[H] |
Setting a height model equal to a given height gives a quadratic whose two solutions are the times going up and coming down. |
| Fencing That Maximizes Area
[H] |
Writing area as a quadratic in one dimension turns a fencing problem into a vertex problem. |
| A Uniform Border Around a Rectangle
[H] |
A border of uniform width adds twice that width to each dimension, so the total area is a quadratic in the width. |