Turning points
Quick review (2 minutes)
The big picture. Use a graph’s changes of direction to put a lower bound on its degree.
A turning point is a point where the graph changes from rising to falling (a peak) or from falling to rising (a valley), read left to right.
A polynomial of degree n, where n is 1 or more, has at most n − 1 turning points.
Backward: a polynomial that is not constant and whose graph has t turning points has degree at least t + 1.
Use the turning-point definition on the graph described in the example. Read left to right: falling changes to rising at (−2, −13), rising changes to falling at (0, 3), and falling changes to rising at (2, −13). Count these direction changes, not the ends or a flat spot that keeps rising.
Count t = 3 turns. Apply the bound t ≤ n − 1: 3 ≤ n − 1 gives n ≥ 4 after adding 1 to both sides. This is a lower bound, because a degree can allow more turns than a graph actually has.
Use the end-behavior rule from the earlier lesson. Both ends point up, so the degree is even and the leading coefficient is positive. The smallest even degree allowed by the turn count is 4.
Check that degree 4 can fit the stated shape with the example’s formula f(x) = − 8 + 3. Its degree is 4 and its leading coefficient 1 is positive, so it allows at most 3 turns and both arms point up. Multiplying out ( − 4 − 13 gives − 8 + 16 − 13 = − 8 + 3, so f(x) = ( − 4 − 13. A square is never negative and is 0 only where − 4 = 0, at x = −2 and x = 2, so the lowest outputs are −13 there. Between them, − 4 runs from 0 down to −4 at x = 0 and back to 0, so its square climbs from 0 to 16 and falls back: the graph rises to (0, 3) and falls again. Outside −2 and 2 the square only grows, so both arms rise.
Finish the check by substitution: f(−2) = 16 − 32 + 3 = −13, f(0) = 3 and f(2) = 16 − 32 + 3 = −13. This degree-4 polynomial has the three stated turns and both arms up, so degree 4 is possible as well as being the lower bound.
Trace the graph left to right with a finger or a pencil tip.
Mark every peak (rising, then falling) and every valley (falling, then rising).
Count the marks. Call the count t.
Add 1 to t for a lower bound. Check the whole graph before naming the least degree: curvature or a level crossing can rule out a line.
Use the end behavior to check the degree parity. If the question gives only turns and end directions, report the least degree those clues allow.
Read the right arm: up means a positive leading coefficient, down means a negative one.
A polynomial f has this graph, read left to right: it comes down from the upper left to a valley at (−2, −13), climbs to a peak at (0, 3), drops to a valley at (2, −13), and then climbs to the upper right forever. The table lists seven points on the graph. How many turning points does the graph have? What is the least possible degree of f? Is the leading coefficient positive or negative?
Turning points: 3, at (−2, −13), (0, 3) and (2, −13).
Least possible degree: 4 (the degree is even and at least 4).
Leading coefficient: positive.
Reading 'at most' as 'exactly'. A degree 3 polynomial does not have to have 2 turning points: y = has none. A graph with 3 turning points does not have to come from degree 4: it could come from degree 6. Going from a formula of degree 1 or more, say 'at most n − 1 turning points'. Going from a graph that is not a flat line, say 'degree at least t + 1'.
polynomial
A function built by adding or subtracting pieces, each a number times x to a whole-number power. Simplified without changing where it is defined, it has no x in the bottom of a fraction, under a root, or up in an exponent.
term
One piece of a polynomial, cut off from the others at each plus or minus sign. The sign in front stays with its piece.
coefficient
The number multiplying the x part of a term, sign included. In −5 the coefficient is −5. When no number is written, it is 1, so has coefficient 1.
degree
The highest power of x in a polynomial once it is multiplied out and like terms are combined, counting only terms whose coefficient is not 0. The zero polynomial has no degree. It is not the number of terms, nor the biggest coefficient. A plain number counts as power 0.
leading term
The term with the highest power of x, sign and coefficient included. It need not be written first. When x is far from 0, it outweighs all the other terms.
leading coefficient
The coefficient of the leading term, its sign included. Together with the degree, it decides where the graph's two ends point. In 3 + 2x − 7x⁴ it is −7.
end behavior
What a graph does far to the left and far to the right. For a polynomial of degree 1 or more, each arm heads up forever or down forever.
turning point
A spot where the graph, read left to right, switches between rising and falling: a hilltop or a valley floor. A polynomial of degree n, n at least 1, has at most n − 1.
1 In plain words
The big picture. Use a graph’s changes of direction to put a lower bound on its degree. The degree limits how many turns are possible. Combine this with intercepts and end behavior from earlier lessons to prepare for sketching polynomial graphs in the next unit.
Picture the graph as a hiking trail that you walk from left to right. Sometimes you climb and sometimes you go down. A hilltop is a spot where climbing switches to going down. The bottom of a dip is a spot where going down switches to climbing. Each of those spots is a turning point: a place where the graph turns around. A polynomial cannot have as many hilltops and dips as it likes. Its degree sets a limit. A polynomial of degree n, where n is 1 or more, has at most n − 1 turning points. Degree 2 allows 1. Degree 5 allows 4. Read backward, a graph with 3 turning points needs a degree of 4 or more.
2 Picture it
Reminder
Reminder: Degree, End behavior, Rising and falling, At most and at least, Adding to both sides of an inequality, A minus sign in front of a power
- Degree. The degree is the highest power of x once the polynomial is multiplied out: 4 − + 1 has degree 5, even though is not written first.
- End behavior. Even degree: both arms point the same way. Odd degree: the arms point opposite ways. The right arm points up when the leading coefficient is positive: y = − has both arms down.
- Rising and falling. Read a graph left to right, like a line of text. Rising means the outputs get larger as x gets larger: y = falls until x = 0 and rises after.
- At most and at least. At most 3 means 3 or fewer: 0, 1, 2 or 3. At least 4 means 4 or more: 4, 5, 6 and so on.
- Adding to both sides of an inequality. Adding the same number to both sides keeps an inequality true: 3 ≤ n − 1 becomes 4 ≤ n.
- A minus sign in front of a power. Do the power first, then the minus sign: for − at x = −2, (−2 = 16, so the value is −16.
3 Why
At a turning point the graph is level for an instant: at a peak it has stopped climbing and has not started down yet, and at a valley it has stopped falling and has not started up yet. Calculus proves that, for a polynomial of degree n of 1 or more, the steepness is described by a polynomial of degree n − 1. Take that one fact on trust here. A polynomial of degree n − 1 has at most n − 1 x-intercepts, because each x-intercept c uses up one factor (x − c). So the steepness can be zero in at most n − 1 places, and every turning point needs one. Some level spots do not turn, which is why the rule says at most.
4 The rule
A turning point is a point where the graph changes from rising to falling (a peak) or from falling to rising (a valley), read left to right.source 1
A polynomial of degree n, where n is 1 or more, has at most turning points.source 1
Backward: a polynomial that is not constant and whose graph has t turning points has degree at least .
Sources (1)
- Jay Abramson. Precalculus 2e, 3.3 Power Functions and Polynomial Functions. OpenStax, 2021. CC BY-NC-SA 4.0. Read 16 Nov 2026.
The same idea, five ways
'the graph turns around here.' For the rule, say: 'a polynomial of degree n, with n at least 1, has at most n minus 1 turning points.'
A turning point is a point on a graph where the graph changes from rising to falling or from falling to rising. For a polynomial of degree 1 or more, the number of turning points is at most one less than its degree.
- degree n ≥ 1: number of turning points ≤ n − 1
- n ≥ t + 1 for a polynomial that is not constant, where t is the number of turning points
- degree 2: at most 1. degree 3: at most 2. degree 4: at most 3
- graph words: a peak (rising, then falling) or a valley (falling, then rising)
A hilltop or the bottom of a dip on a trail: the spot where uphill becomes downhill, or downhill becomes uphill.
The same idea, other ways
Take f(x) = − 3x and read the output row of the table left to right: −18, −2, 2, 0, −2, 2, 18. The outputs climb to 2 (the column under −1), drop through 0 to −2 (the column under 1), then climb again. Two switches of direction, so two turning points: a peak at (−1, 2) and a valley at (1, −2). The degree is 3 and 3 − 1 = 2, so this graph uses its full allowance. A table can miss a turn that sits between two columns, so a graph is the safer place to count. Here the graph agrees with the table.
Think of the temperature over one day. It climbs through the morning, tops out in the middle of the afternoon, and drops through the night until dawn, when it starts climbing again. The afternoon high and the dawn low are the turning points of the day's temperature graph. Nothing special happens at noon, when the temperature is still climbing, even if it passes a round number like 70 degrees on the way up. Passing a level is not turning around. In the same way, a graph crossing the x-axis is not a turning point unless the graph also switches direction there.
Look at y = . Its degree is 3, so it is allowed up to 3 − 1 = 2 turning points. It uses none. The graph climbs, levels off for an instant at (0, 0), and keeps climbing. It never comes back down, so nothing turned around. The degree tells you the most turning points a graph can have. The graph is free to have fewer.
Forward, subtract. Backward, add for a lower bound. For a nonconstant polynomial, degree minus 1 is the most turns. Turns plus 1 is the degree bound from that count alone. Look at the whole picture too: a curved graph with a level crossing cannot be a line, even when it has zero turns. The parabola y = anchors the count: degree 2, one turn.
Degree n ≥ 1: at most n − 1 turning points
Not constant, t turning points: degree at least t + 1
Anchor: y = has degree 2 and 1 turn
Suppose both arms point up. Reading left to right, the graph starts out falling, because it is coming down from the upper left, and it ends up rising. To start falling and end rising, it must switch direction an odd number of times: 1, 3, 5 and so on. For a polynomial that is not constant, arms pointing the same way mean an even degree, so an even degree goes with an odd number of turning points. Now suppose the arms point opposite ways. Then the graph starts and ends going the same direction, so it switches an even number of times: 0, 2, 4 and so on. That is an odd degree. This gives a free check on every count.
| Degree n | Limit: n − 1 turning points | Counts that can happen | Examples |
|---|---|---|---|
| 1 | 0 | 0 | y = 2x + 1 has 0: a line never turns |
| 2 | 1 | 1 | y = has 1: one valley |
| 3 | 2 | 0 or 2 | y = has 0 y = − 3x has 2 |
| 4 | 3 | 1 or 3 | y = has 1 y = − 8 + 3 has 3 |
| 5 | 4 | 0, 2 or 4 | y = has 0 y = − 5 + 4x has 4 |
Part 1: Could this be a polynomial graph?
Before counting hills, check whether the road is the right kind of road. A polynomial graph is smooth and unbroken for every real input. You can reject a corner, a hole, a jump or a vertical asymptote. An asymptote is a line the graph approaches; a vertical one can have heights grow without bound near one input.
- Why: a finite sum of whole-number powers is defined and continuous for every real x. Its slope is a polynomial too, so it has no sharp corner.
- Rule: any missing real input, jump, corner or vertical asymptote rules out a polynomial.
- A nonconstant polynomial also grows without bound at both far ends. A nonconstant curve that approaches a fixed height at an end is not a polynomial.
- Method: check the domain and joins, check the ends, then count turns only if a polynomial is possible.
- A smooth unbroken picture can be consistent with a polynomial. Those features alone do not prove that its formula is a polynomial.
Worked example
A corner rules a polynomial out
The graph shown has a sharp corner at (4, 6). Could it be a polynomial graph? Explain.
What it asks. The graph shown has a sharp corner at (4, 6). Could it be a polynomial graph? Explain.
Show the steps and the answer
The plan. Inspect the joins in the curve before counting its turns.
- Plan. Inspect the joins in the curve before counting its turns.
- Inspect the joins in the curve before counting its turns.
- The curve has no gap, but it has a sharp corner.Its two straight sides meet with different directions at one point.
- It cannot be a polynomial graph.A polynomial has a smooth graph at every real input; its direction cannot jump at a corner.
Counterexamples
What it is not, and the tempting wrong moves.
Tips and tricks
- For an exam, practice this method with the answer folded. Check each step against the reason beside it.
Part 2: Reading the whole graph
Turn counts are like a minimum ticket price: they give a starting bound, and extra requirements can raise it. First count each change of direction. Then read the ends and any clear shape information. A straight line and a curved flat crossing can both have zero turns, but only the line can have degree 1.
- Rule: t turns imply n ≥ t + 1 for a nonconstant polynomial. That statement is a lower bound, not a formula for every visible graph.
- Method: count turns, add 1, check even or odd degree from the ends, then rule out degrees that cannot show the remaining features.
- Why: a line has constant slope. A curved graph with an isolated level spot cannot be linear. A cubic can rise or fall through a level spot without turning.
- If the question gives only the turn count, t + 1 is the least degree allowed by that count alone. A flat horizontal graph is the separate constant case.
Worked example
A curved crossing with no turn
The graph shown is smooth, rises throughout, has a level crossing at (4, 6), and has opposite ends. Find the number of turning points and the least polynomial degree consistent with these features.
What it asks. The graph shown is smooth, rises throughout, has a level crossing at (4, 6), and has opposite ends. Find the number of turning points and the least polynomial degree consistent with these features.
Show the steps and the answer
The plan. Count direction changes first. Then ask whether a line could have the visible shape.
- Plan. Count direction changes first. Then ask whether a line could have the visible shape.
- Count direction changes first. Then ask whether a line could have the visible shape.
- There are 0 turning points.The graph rises before and after its level spot, so it never switches direction.
- The turn count gives .This is a lower bound from turns alone.
- Degree 1 is impossible because the graph is curved and has a level spot.A nonconstant degree-1 polynomial is a straight line with the same nonzero slope everywhere.
- Opposite ends require odd degree. The least remaining choice is 3.Degree 2 has matching ends. The cubic (x − 4 + 6 has all the stated features.
- Turning points: 0
- Least possible degree: 3
Counterexamples
What it is not, and the tempting wrong moves.
Tips and tricks
- For an exam, practice this method with the answer folded. Check each step against the reason beside it.
5 How
- Use the turning-point definition on the graph described in the example. Read left to right: falling changes to rising at (−2, −13), rising changes to falling at (0, 3), and falling changes to rising at (2, −13). Count these direction changes, not the ends or a flat spot that keeps rising.
- Count t = 3 turns. Apply the bound t ≤ n − 1: 3 ≤ n − 1 gives n ≥ 4 after adding 1 to both sides. This is a lower bound, because a degree can allow more turns than a graph actually has.
- Use the end-behavior rule from the earlier lesson. Both ends point up, so the degree is even and the leading coefficient is positive. The smallest even degree allowed by the turn count is 4.
- Check that degree 4 can fit the stated shape with the example’s formula f(x) = − 8 + 3. Its degree is 4 and its leading coefficient 1 is positive, so it allows at most 3 turns and both arms point up. Multiplying out ( − 4 − 13 gives − 8 + 16 − 13 = − 8 + 3, so f(x) = ( − 4 − 13. A square is never negative and is 0 only where − 4 = 0, at x = −2 and x = 2, so the lowest outputs are −13 there. Between them, − 4 runs from 0 down to −4 at x = 0 and back to 0, so its square climbs from 0 to 16 and falls back: the graph rises to (0, 3) and falls again. Outside −2 and 2 the square only grows, so both arms rise.
- Finish the check by substitution: f(−2) = 16 − 32 + 3 = −13, f(0) = 3 and f(2) = 16 − 32 + 3 = −13. This degree-4 polynomial has the three stated turns and both arms up, so degree 4 is possible as well as being the lower bound.
Bounding the degree from a graph
- Trace the graph left to right with a finger or a pencil tip.
- Mark every peak (rising, then falling) and every valley (falling, then rising).
- Count the marks. Call the count t.
- Add 1 to t for a lower bound. Check the whole graph before naming the least degree: curvature or a level crossing can rule out a line.
- Use the end behavior to check the degree parity. If the question gives only turns and end directions, report the least degree those clues allow.
- Read the right arm: up means a positive leading coefficient, down means a negative one.
6 Worked example
Worked example
Bound the degree from a graph with three turning points
A polynomial f has this graph, read left to right: it comes down from the upper left to a valley at (−2, −13), climbs to a peak at (0, 3), drops to a valley at (2, −13), and then climbs to the upper right forever. The table lists seven points on the graph. How many turning points does the graph have? What is the least possible degree of f? Is the leading coefficient positive or negative?
Show the steps and the answer
- Say what is asked. Count the places where the graph turns around, use that count to find the smallest degree the polynomial could have, then read the sign of the leading coefficient from the arms.The rule connects the number of turning points to the degree, so the count comes first.
- Trace left to right. In the table the outputs fall from 12 (the column under ) to (the column under ), then rise to and 3. The graph switches from falling to rising at . Mark it: a valley.A turning point is a place where falling changes to rising, or rising changes to falling.
- Keep tracing. The outputs rise to 3 (the column under 0), then fall to and . The graph switches from rising to falling at (0, 3). Mark it: a peak.Rising, then falling, is the other kind of turning point.
- Keep tracing. The outputs fall to (the column under 2), then rise to 12 (the column under 3) and keep rising. The graph switches from falling to rising at . Mark it: a valley.Every switch counts, including a second valley at the same height as the first.
- Count the marks: turning points.There are three switches of direction and no others. The two arms are not turning points, because the graph does not turn around there.
- Use the rule backward. A degree n allows at most turning points, so . Add 1 to both sides: . This step finds the smallest degree that has room for 3 turning points: the degree is at least 4.Adding the same number to both sides of an inequality keeps it true.
- Read the arms. The left arm points up and the right arm points up. Arms pointing the same way mean an even degree, and a right arm pointing up means a positive leading coefficient.End behavior comes from the leading term: an even power with a positive coefficient is large and positive at both ends.
- Put the two facts together. The degree is at least 4 and it is even, so the least possible degree is 4, and it cannot be 5.The graph shows how many turning points the formula must allow, and 4 is the smallest even degree with room for three.
- Turning points: 3, at (−2, −13), (0, 3) and (2, −13).
- Least possible degree: 4 (the degree is even and at least 4).
- Leading coefficient: positive.
Ladder: from easy to exam-hard
Try each rung before you open its steps.
Rung 1 of 9
The limit from a formula
At most how many turning points can the graph of g(x) = 7 − 2 + x − 9 have?
Show the steps and the answer
- Say what is asked: find the degree, then subtract 1 to get the largest number of turning points the graph could have.The rule goes from the degree to a limit on turning points.
- Find the degree. The powers of x are 5, 3 and 1, and the constant has no x. The highest power is 5, so .The degree is the highest power of x in the polynomial.
- Subtract 1: .A polynomial of degree n has at most n − 1 turning points.
Rung 3 of 9
Two turning points on a graph
A polynomial's graph, read left to right, comes up from the lower left to a peak at (−1, 7), falls to a valley at (2, −20), and then rises to the upper right forever. The table lists seven points on it. What is the least possible degree?
Show the steps and the answer
- Say what is asked: count the turning points, then find the smallest degree that allows that many.A graph gives the count, and the count gives the least degree.
- Trace left to right. The outputs rise from (the column under ) to 7 (the column under ), then fall. The switch from rising to falling at is a peak. Mark it.Rising, then falling, is a turning point.
- Keep tracing. The outputs fall through 0 and to (the column under 2), then rise to and 32. The switch from falling to rising at is a valley. Mark it.Falling, then rising, is a turning point. Passing through 0 on the way down is a crossing of the x-axis, not a turn.
- Count: . Add 1: the degree is at least .A graph with t turning points has degree at least t + 1.
Rung 4 of 9
Can this degree draw this graph?
A polynomial graph has 4 turning points. Someone says the polynomial has degree 4. Can that be right?
Show the steps and the answer
- Say what is asked: decide whether a degree of 4 has room for 4 turning points.The degree sets a limit, so compare the count with the limit.
- Find the limit for degree 4: turning points.A polynomial of degree n has at most n − 1 turning points.
- Compare. The graph has 4 turning points, and 4 is more than 3. Degree 4 cannot draw this graph.At most 3 means 3 or fewer.
- Find the smallest degree that can: .A graph with t turning points has degree at least t + 1.
- No. Degree 4 allows at most 3 turning points.
- The degree is at least 5.
Rung 5 of 9
Turning points and x-intercepts disagree
A polynomial's graph rises from the lower left to a peak at (−1, 4), dips to a valley at (0, 3), rises to a second peak at (1, 4), and then falls to the lower right forever. It crosses the x-axis only twice. The table lists five points on it. Find the least possible degree, say whether the degree is even or odd, and give the sign of the leading coefficient.
Show the steps and the answer
- Say what is asked: count the turning points to get the least degree, then use the arms to decide even or odd and the sign of the leading coefficient.Turning points bound the degree, and end behavior gives the rest.
- Trace and mark. Rising to , then falling: a peak. Falling to (0, 3), then rising: a valley. Rising to (1, 4), then falling: a peak. In the output row of the table: , 4, 3, 4, .Each switch between rising and falling is a turning point.
- Count: . The valley at (0, 3) counts even though it is shallow and sits above the x-axis.A turning point is about the direction changing, not about how deep the dip is or whether it reaches the x-axis.
- Add 1: the degree is at least .A graph with t turning points has degree at least t + 1.
- Set aside the tempting count. Two x-intercepts might suggest degree 2, but a degree 2 polynomial allows only turning point, and this graph has 3.The number of x-intercepts can be smaller than the degree, so it cannot be used to pin the degree down here.
- Read the arms. Both arms point down. Arms pointing the same way mean an even degree, and a right arm pointing down means a negative leading coefficient.An even power with a negative coefficient is large and negative at both ends.
- Least possible degree: 4.
- The degree is even.
- The leading coefficient is negative.
Rung 6 of 9
Check a graph with a missing input
The graph shown follows y = 7x − 13 except that the open circle at (3, 8) is missing. Could it be a polynomial graph? Explain.
What it asks. The graph shown follows y = 7x − 13 except that the open circle at (3, 8) is missing. Could it be a polynomial graph? Explain.
Show the steps and the answer
The plan. A straight shape alone is not enough. Check whether any input is missing.
- Plan. A straight shape alone is not enough. Check whether any input is missing.
- A straight shape alone is not enough. Check whether any input is missing.
- There is no output at .An open circle marks a point left out of the graph.
- It cannot be a polynomial function on its stated domain.A polynomial is defined and continuous at every real input; the hole violates that requirement.
Rung 7 of 9
Check a graph with separated branches
The graph shown has two branches, with no output at x = 3. The heights grow without bound beside that line. Could it be a polynomial graph? Explain.
What it asks. The graph shown has two branches, with no output at x = 3. The heights grow without bound beside that line. Could it be a polynomial graph? Explain.
Show the steps and the answer
The plan. Check whether the branches join at every input. A polynomial cannot shoot to infinity at a finite input.
- Plan. Check whether the branches join at every input. A polynomial cannot shoot to infinity at a finite input.
- Check whether the branches join at every input. A polynomial cannot shoot to infinity at a finite input.
- The branches do not join at .The graph has no finite value at that input.
- It cannot be a polynomial graph.Polynomials have a finite value at every finite real input and have no gaps or vertical asymptotes.
Rung 8 of 9
Read a line from its graph
The graph shown is a nonconstant straight line that falls throughout. Find its turning points and least possible polynomial degree.
What it asks. The graph shown is a nonconstant straight line that falls throughout. Find its turning points and least possible polynomial degree.
Show the steps and the answer
The plan. Unlike a curved flat crossing, a straight nonhorizontal line fits degree 1.
- Plan. Unlike a curved flat crossing, a straight nonhorizontal line fits degree 1.
- Unlike a curved flat crossing, a straight nonhorizontal line fits degree 1.
- It has 0 turning points.It never switches from falling to rising.
- The least possible degree is 1.A nonconstant line has the form mx + b with m ≠ 0, which has degree 1. A constant would be horizontal.
- Turning points: 0
- Least possible degree: 1
Rung 9 of 9
Read a falling curve from its graph
The graph shown is smooth, curved and falling throughout. It levels at (−3, 2) without turning, and its ends point opposite ways. Find its turning points and least possible polynomial degree.
What it asks. The graph shown is smooth, curved and falling throughout. It levels at (−3, 2) without turning, and its ends point opposite ways. Find its turning points and least possible polynomial degree.
Show the steps and the answer
The plan. Do not count a flat spot as a turn. Do use it to rule out a straight line.
- Plan. Do not count a flat spot as a turn. Do use it to rule out a straight line.
- Do not count a flat spot as a turn. Do use it to rule out a straight line.
- It has 0 turning points.Falling continues on both sides of the level spot.
- The count gives degree at least 1, but the curved shape excludes degree 1.A degree-1 graph has constant slope and cannot flatten at one isolated point.
- The least possible degree is 3.The opposite ends need odd degree, and degree 3 is the smallest odd choice after 1.
- Turning points: 0
- Least possible degree: 3
Counterexamples
What it is not, and the tempting wrong moves.
Tips and tricks
- Anchor on the parabola. Degree 2, one turning point. If you forget whether the rule is n − 1 or n + 1, picture y = : it turns once, and 2 − 1 = 1. This rule can be rebuilt in ten seconds, so there is no need to memorize it as a formula.
- Forward, subtract for the maximum turns. Backward, add for a degree lower bound. Then use any extra graph features before naming the least degree.
- Even and odd check, for a polynomial that is not constant: an even degree has an odd number of turning points, and an odd degree has an even number (zero counts as even). If the turns you see and the arms disagree, recount, and look for turns outside the picture.
- Trace with a finger, left to right, and say 'up' or 'down' as you go. Each time the word changes, you passed a turning point.
- A graph shows one window. Turning points can hide outside it, so a graph gives the least possible degree, never the exact degree.
- Other names you will see: a peak is called a local maximum and a valley is called a local minimum. 'Local' means highest or lowest compared with the points right around it, not on the whole graph.
7 The trap
Reading 'at most' as 'exactly'. A degree 3 polynomial does not have to have 2 turning points: y = has none. A graph with 3 turning points does not have to come from degree 4: it could come from degree 6. Going from a formula of degree 1 or more, say 'at most n − 1 turning points'. Going from a graph that is not a flat line, say 'degree at least t + 1'.
Keep in mind
- Exam skills: rule out graphs with corners, gaps or vertical asymptotes; count turns on graphs that can be polynomials.
- Use turns for a lower bound on degree. Then check the ends and visible shape before naming the least degree.
Flash cards
Say the answer out loud, then flip.
On the hiking trail picture, what is a turning point?
- A spot where the graph turns around, read left to right.
- A hilltop: climbing switches to going down.
- The bottom of a dip: going down switches to climbing.
A polynomial has degree 6. How many turning points can its graph have?
- At most 5, because the limit is n − 1 and 6 − 1 = 5.
- It can have fewer. The rule says at most, not exactly.
You trace a polynomial graph and count 4 turning points. What does that say about the degree?
- The degree is at least 5, because t + 1 = 4 + 1 = 5.
- 5 is the least possible degree. The real degree could be higher.
When you count turning points on a graph, which spots do you leave out?
- The two arms.
- Any level spot where the graph keeps going the same way, like the flat spot on y = , which has no turning points.
Sources
- Jay Abramson. Precalculus 2e, 3.3 Power Functions and Polynomial Functions. OpenStax, 2021. CC BY-NC-SA 4.0. Read 16 Nov 2026.