Graphing Functions: Star problems
Ten optional challenges to stretch your reasoning. Work on paper, use hints when you need them, and check the answer or full solution when you are ready. You can skip these problems and continue the course.
- 1 of 3 stars: Stretch
- 2 of 3 stars: Challenge
- 3 of 3 stars: Deep challenge
Stars indicate difficulty within this set.
0 of 10 completed · 0 skipped
Progress saved in this browser.
Progress can't be saved in this browser, so your choices last for this visit only.
-
Problem 1 Move the graph, then read its zeros
Difficulty: 1 of 3 stars, Stretch
The graph of consists exactly of the straight segments joining, in order, , , , and . Both endpoints are included. Define wherever the expression is defined.
Give the vertices of the graph of in left-to-right order, its domain and range, and all its zeros. Explain why simply transforming the zeros of would not answer the last question.
Text description of this figure
A coordinate grid with x running from -4 to 3 and y from -2 to 4, and the origin labeled 0. The graph of f is a broken line made of three straight segments. It starts at the point (-4, 1), rises to (-1, 4), falls to (1, -2), and rises again to end at (3, 2). Each of these four points is marked with a dot and labeled with its coordinates.
Builds on Graphs of Functions, Shifting Graphs, Stretching and Reflecting Graphs
- Hint 1
Track an old point by solving and calculating the new height .
- Hint 2
The equation asks where the original graph has height , not height .
Answer
Vertices ; domain , range ; zeros and .
Full solution
An original point maps to .
The four vertices therefore become .
Reversing their order gives the left-to-right list in the answer.
Straight segments remain straight under these coordinate changes.
The horizontal extent is , and the lowest and highest vertex heights are and ; the connected segments attain every height between them.
For a zero, solve
The first original segment stays between heights and , so it contributes none.
On the middle segment, the equation of the line is .
Its height is at , giving
On the final segment, , which equals at , giving .
Both old inputs lie in their segments, so both zeros are valid and the list is complete.
An old zero has height , so its new height is , not .
The vertical shift changes which horizontal level must be inspected before the input transformation is applied.
Answer
Vertices ; domain , range ; zeros and .
Key idea
To find transformed zeros, first determine the required old output level, then transform its input locations.
- Hint 1
-
Problem 2 When does order stop mattering?
Difficulty: 1 of 3 stars, Stretch
A function has exactly one point of greatest height, at . Let shift its graph horizontally by units, where is any real number. Let stretch every horizontal coordinate by a factor , leaving heights unchanged.
Find all pairs for which applying and then gives exactly the same graph as applying and then . Prove both necessity and sufficiency.
If the unique-highest-point assumption is removed, must your condition still be necessary? Give a counterexample or a proof.
Builds on Shifting Graphs, Stretching and Reflecting Graphs, Graphs of Functions
- Hint 1
Follow the unique highest point through the two orders.
- Hint 2
The first order sends a horizontal coordinate to ; the second sends it to .
Answer
Exactly or . Without the assumption the condition need not be necessary; a constant function is a counterexample.
Full solution
Both transformations preserve heights and are reversible, so the unique highest point stays unique.
In the order then , its horizontal coordinate becomes
In the other order it becomes .
If the resulting graphs are identical, their unique highest points must coincide.
Hence , or , proving the necessary alternatives or .
To check sufficiency for the entire graph, track an arbitrary old point .
The two orders send it respectively to and .
When , these agree for every point, so the resulting graphs are identical.
Matching only one landmark gave necessity; the arbitrary-point calculation gives sufficiency.
Without a unique highest point, take for every real .
Any horizontal shift or stretch leaves this horizontal line unchanged.
Thus, for example, and work even though neither of the stated alternatives holds.
A distinctive landmark rules out such extra symmetries.
Answer
Exactly or . Without the assumption the condition need not be necessary; a constant function is a counterexample.
Key idea
Track a unique geometric feature to prove necessity, and then track an arbitrary point to prove equality of whole graphs.
- Hint 1
-
Problem 3 An inverse can meet off the diagonal
Difficulty: 1 of 3 stars, Stretch
The graph of consists exactly of the segments from to and from to .
Prove that has an inverse. Find every point shared by the graphs of and . Does every shared point lie on ? Justify completeness using the graph segments.
Text description of this figure
A coordinate grid in the first quadrant, with x and y each running from 0 to 4, and the origin labeled 0. The graph of f is two straight segments: a gentle fall from the point (0, 4) to (2, 3), then a steeper fall from (2, 3) to (4, 0). The three points are marked with dots and labeled with their coordinates.
- Hint 1
Reflect each vertex across to obtain the inverse graph.
- Hint 2
Use the breakpoints and to compare the two straight-line formulas on three intervals.
Answer
The shared points are , , and . Two of them are off the diagonal.
Full solution
The original graph is strictly decreasing and takes every output between and exactly once.
Thus it has an inverse on .
Reflecting its vertices gives the inverse graph with left-to-right vertices .
For , the original line has height , while the inverse line has height .
Equality forces , giving .
For , the original height is and the inverse height is still .
Equality gives , so .
The common height is also , and this input lies in the interval.
For , the inverse height is .
Equating this to gives , hence .
The three intervals cover the common domain, so the list is complete.
The off-diagonal points occur because and : applying twice returns to the starting input even though one application changes it.
Reflection across does not force two reflected graphs to intersect only on the mirror line.
Solid: . Dashed: Answer
The shared points are , , and . Two of them are off the diagonal.
Key idea
An inverse-graph intersection can represent a two-step return, so check the monotonic direction before imposing .
- Hint 1
-
Problem 4 Area exchanged by reflection
Difficulty: 2 of 3 stars, Challenge
The graph of consists exactly of the segments joining , , , and .
Find the exact area enclosed by the graphs of and . Justify which graph is higher between their endpoints and explain how reflection across lets you calculate the area without first finding formulas for the inverse.
Text description of this figure
A coordinate grid in the first quadrant, with x and y each running from 0 to 6. The graph of f is a broken line of three straight segments that rises from the point (0, 0) to (1, 3), then to (3, 4), then to (6, 6). The four points are marked with dots and labeled with their coordinates.
- Hint 1
Compare each original segment with the diagonal of the by square.
- Hint 2
Reflection sends the region below the graph of to the region to the left of the inverse graph. Relate the areas under the two graphs to the square.
Answer
The enclosed area is square units.
Full solution
The graph is strictly increasing and runs from to , so it has an inverse on the same interval.
At the two internal vertices, is and , and it is zero at the endpoints.
Since changes linearly on each segment, the graph is strictly above for every interior input.
Its reflected inverse is strictly below the diagonal there.
Consequently the two graphs enclose a single region.
Let be the area under in the square , and let be the area under its inverse.
Reflection in takes the region below to the region above the inverse, so .
This uses the fact that reflection preserves area; it does not require inverse formulas.
Using one triangle and two trapezoids, the original area is .
Thus
Because is the higher graph throughout the interior, the requested area is
Subtracting areas works here because the graphs do not cross between the endpoints.
Shaded area: square units Answer
The enclosed area is square units.
Key idea
Use geometric symmetry to exchange a difficult area with a complementary area that is easy to calculate.
- Hint 1
-
Problem 5 One final graph, many transformations
Difficulty: 2 of 3 stars, Challenge
Let on all real numbers. Find every quadruple of real numbers with such that the transformed graph is exactly the graph .
Explain why the final graph does not uniquely determine its horizontal and vertical stretch factors.
Builds on Shifting Graphs, Stretching and Reflecting Graphs
- Hint 1
Put the original parabola in vertex form before composing.
- Hint 2
The final leading coefficient and vertex impose three conditions, while the horizontal factor can remain free.
Answer
For any real , take , , and . These are all quadruples.
Full solution
The original function is
Thus the transformed equation is
Its coefficient of is .
The target coefficient is , so .
In particular, a zero or negative vertical coefficient cannot work.
The transformed vertex occurs where .
Since the target vertex has input , we need , or .
Its height is , which must equal , giving .
These conditions were forced by equality of the graphs.
Conversely, for any nonzero real , the displayed choices give and .
Hence every quadruple in the family works.
The free parameter represents a trade between horizontal and vertical scaling: squaring multiplies a horizontal input factor into a height factor , which the coefficient exactly cancels.
The sign of can also reverse horizontal orientation without changing the squared expression.
Thus one final parabola can arise through infinitely many transformation descriptions.
Answer
For any real , take , , and . These are all quadruples.
Key idea
A transformation description need not be unique when the original graph has scaling or reflection symmetries.
- Hint 1
-
Problem 6 A moving copy of a tent
Difficulty: 2 of 3 stars, Challenge
The graph of consists exactly of the segments from to and from to , with domain . For each real , shift this graph units to the right, obtaining on .
For every , determine how many points the shifted graph shares with the original. When the number is finite and positive, give the intersection coordinates in terms of . Prove completeness.
Text description of this figure
A pair of labeled axes with no grid. The graph, labeled y equals f of x, is two straight segments: it rises from the point (0, 0) to a peak at (2, 6), then falls to the point (5, 0) on the x axis. The three points are marked with dots and labeled with their coordinates.
Builds on Shifting Graphs
- Hint 1
If , the shifted graph uses the smaller old input . Equal heights cannot come from two inputs on the same strictly monotone side of the tent.
- Hint 2
A meeting must use the falling side of the original tent and the rising side of the shifted tent. Their heights are and .
Answer
For , the graphs coincide. For , there is exactly one shared point: . For , there are none.
Full solution
At , the graphs are identical and share infinitely many points.
If , their domains and are disjoint, so no intersection is possible.
Now let .
At a common input, .
If both old inputs lie on the rising side, strict increase makes their outputs unequal.
If both lie on the falling side, strict decrease does the same.
The only remaining possibility places on the rising side and on the falling side.
It requires and
The rising-side equation is ; the falling-side equation is
Thus a common point must satisfy , giving and .
For every , this candidate satisfies and
It therefore belongs to the correct segments and works.
The linear equation has only one solution, so it is the unique meeting point.
At the formula gives , the single shared endpoint of the domains.
Answer
For , the graphs coincide. For , there is exactly one shared point: . For , there are none.
Key idea
Use monotonicity to determine which graph pieces can meet before solving their equations.
- Hint 1
-
Problem 7 Tilting a graph through three zeros
Difficulty: 2 of 3 stars, Challenge
The graph of consists exactly of the segments joining , , , and , with endpoints included. For a real parameter , define on .
Find all for which has exactly three distinct zeros. Account carefully for zeros at vertices and at domain endpoints; a shared vertex counts only once.
Text description of this figure
A coordinate grid with x running from -3 to 4 and y from -1 to 3, and the origin labeled 0. The graph of f is a broken line of three straight segments. It starts on the x axis at the point (-3, 0), rises to (-1, 3), falls to (1, -1), and rises again to end at (4, 2). Each of these four points is marked with a dot and labeled with its coordinates.
Builds on Graphs of Functions
- Hint 1
Adding keeps each segment straight and changes only its vertex heights.
- Hint 2
The new heights, in order, are , , , and . For three distinct zeros, each of the three segments must supply one.
Answer
Exactly .
Full solution
The new vertex heights are , , , and .
No adjacent pair can both be zero: the required values of would conflict in each case.
Thus no whole segment lies on the axis, and each segment contains at most one zero.
Three distinct zeros therefore require one on each segment.
Neither internal vertex can be zero, since a zero shared by two segments would leave at most two distinct zeros in total.
In particular, the middle segment must cross strictly through the axis: .
This means or .
If , both and are negative, so the first segment has no zero.
This case fails.
For , we have and .
The first segment has a zero precisely when , or ; equality allows the left domain endpoint.
The last segment has a zero precisely when , or .
Combining these gives .
Conversely, throughout this interval the first segment meets the axis, the middle crosses it, and the last crosses it.
None of these zeros is a shared internal vertex, so there are exactly three.
At the middle and last zeros merge at the vertex , explaining why the upper endpoint is excluded.
Answer
Exactly .
Key idea
Count distinct intersections by signs at landmarks, treating shared vertices separately from crossings.
- Hint 1
-
Problem 8 Two symmetries force a repeating graph
Difficulty: 3 of 3 stars, Deep challenge
The graph of a function is unchanged by reflection across the vertical line and by a half-turn about . A half-turn sends a point to . Also .
(a) Prove that shifting the graph units horizontally leaves it unchanged.
(b) Find .
(c) Could shifting it units horizontally also leave it unchanged? Justify your answer. Do not assume the graph is a parabola or a straight line.
Builds on Shifting Graphs, Stretching and Reflecting Graphs
- Hint 1
Translate the two geometric symmetries into identities relating function values.
- Hint 2
Compose the two point transformations. One composition shifts the input by while reflecting the output about height .
Answer
(a) for every real . (b) . (c) No: .
Full solution
Reflection across gives
The half-turn gives
Apply the reflection identity to the input to obtain
Applying this new relation twice yields for every real .
Thus an -unit shift preserves the graph.
The half-turn relation at gives
Since , repeated use of the period gives
The four-unit relation gives
This differs from , so a four-unit shift cannot preserve the graph.
Proving that is a period does not by itself prove it is the smallest positive period; that stronger assertion was not required.
The assumptions are consistent.
One example is obtained by joining to to with straight segments and repeating that pattern every units.
Its reflected and half-turned copies agree with the same repeating graph, and its value at is .
Answer
(a) for every real . (b) . (c) No: .
Key idea
Compose graph symmetries algebraically; two reflections or rotations can force a translation relation.
- Hint 1
-
Problem 9 Intersections with a moving inverse
Difficulty: 3 of 3 stars, Deep challenge
For each real parameter , define on the domain .
Determine, for every real , all points shared by the graphs of and its inverse, and give the number of such points. Your argument must justify why no off-diagonal intersections are possible and must respect both graph domains.
Builds on Shifting Graphs
- Hint 1
The restricted function is strictly increasing. If and , compare the orders of and .
- Hint 2
After proving a common point lies on , put . The resulting equation is quadratic in .
Answer
No points for ; one point for ; two for ; one for . The possible diagonal coordinates are , retaining both signs in the two-point case and only when .
Full solution
On , the quantity is nonnegative and strictly increases, so is strictly increasing with range .
Its inverse is on .
If belongs to both graphs, then and , with both inputs allowed.
If , increasing behavior would imply , a contradiction.
The case fails similarly.
Thus every shared point is diagonal.
Put and .
Then is equivalent to , or
Any valid solution automatically has , so it lies in the inverse domain as well as the original domain.
For there are no real .
At , gives .
For larger , the candidates are
Both are nonnegative when , giving two distinct points.
When , only is nonnegative, giving one.
Finally yields the stated coordinates .
Each retained value solves the original fixed-point equation on both domains, so every listed diagonal point really is shared.
Answer
No points for ; one point for ; two for ; one for . The possible diagonal coordinates are , retaining both signs in the two-point case and only when .
Key idea
An increasing function has no nontrivial two-step cycles; use that order fact before solving inverse-graph equations.
- Hint 1
-
Problem 10 Two graph rules determine every point
Difficulty: 3 of 3 stars, Deep challenge
Find all strictly increasing functions whose graphs have both of these properties: shifting every point right by and up by leaves the graph unchanged; multiplying both coordinates of every point by also leaves the graph unchanged.
Prove that your list is complete without assuming a formula, continuity, or differentiability for . You may use the elementary fact that powers of eventually exceed any fixed positive real number.
Builds on Shifting Graphs, Stretching and Reflecting Graphs
- Hint 1
Turn the geometric rules into identities for and . Determine at integer inputs first.
- Hint 2
For a positive integer , choose consecutive integers bracketing . Increasing behavior traps between two values whose gap shrinks as grows.
Answer
The only function is for every real .
Full solution
The graph rules give and
The second identity at forces .
The first then gives for every integer , using repeated shifts in either direction.
Repeated doubling gives for every positive integer .
Fix an arbitrary real input .
For any positive integer , choose an integer such that
Since is strictly increasing,
The same two bounds also contain , by multiplying the bracketing inequality by .
Thus the distance between and is less than , for every positive integer .
If that distance were a positive number , choose so large that .
The distance would then be less than , a contradiction.
Therefore .
Since was arbitrary, the rule holds everywhere.
Conversely, is strictly increasing and its graph is unchanged by both specified transformations, proving existence and uniqueness.
Answer
The only function is for every real .
Key idea
Order can trap an unknown graph between arbitrarily close known points, forcing exact values without a continuity assumption.
- Hint 1