Rational Expressions and 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 Two ways to group division
Difficulty: 1 of 3 stars, Stretch
Let be real numbers with and . Determine exactly when , including the possibility .
Now take , , and . Find the original real domain of both grouped expressions and every input at which they are equal. Explain why dividing both sides by would give an incomplete answer.
- Hint 1
Express the left side as and the right side as , then clear only known nonzero factors.
- Hint 2
The general equality reduces to . In the application, handle before solving and .
Answer
The general condition is or . The common original domain is , and equality occurs exactly at .
Full solution
Both grouped expressions are defined because and are nonzero.
They simplify to and , respectively.
Multiplying their equality by the nonzero gives , or
Therefore equality holds precisely when or or .
Each of these conditions also directly makes the original expressions equal.
In the application, defining excludes .
Both groupings require , excluding , and , excluding .
No other exclusion arises: for the right grouping, the intermediate denominator is nonzero exactly when these conditions hold.
On this domain, gives , both permitted.
The equation would require , which is impossible.
The equation gives , hence , also permitted.
These exhaust the general criterion and so exhaust the answers.
Dividing the equality by at the start would improperly discard the valid inputs and .
Parentheses change division because dividing by a quotient multiplies by its reciprocal.
Answer
The general condition is or . The common original domain is , and equality occurs exactly at .
Key idea
Before canceling a variable factor, separate its zero case; grouping division changes which factors become reciprocals.
- Hint 1
-
Problem 2 Three fractions with one numerator
Difficulty: 1 of 3 stars, Stretch
Find all real solutions of
Locate each solution relative to the forbidden inputs , using exact comparisons rather than decimal approximations.
- Hint 1
Factor out the common numerator before multiplying all three denominators.
- Hint 2
Keep the possibility . For , the numerator of the reciprocal sum becomes especially simple after the shift .
Answer
and . The latter zeros lie in and , respectively.
Full solution
The domain excludes
On that domain the equation is
Thus is one valid solution.
Dividing immediately by would lose it.
For the other solutions, combine the three reciprocal fractions.
Their numerator is .
Since the common denominator is nonzero on the domain, this numerator must be zero.
Hence
The inequalities follow from .
Therefore the smaller root lies strictly between and , and the larger strictly between and .
Neither is forbidden, and the additional solution lies to the right of all three forbidden inputs.
Each manipulation was reversible after retaining the branch, which proves both validity and completeness.
Answer
and . The latter zeros lie in and , respectively.
Key idea
Preserve a zero-numerator branch before reducing a rational equation to a common denominator.
- Hint 1
-
Problem 3 Reconstructing a rational graph
Difficulty: 1 of 3 stars, Stretch
A rational expression has monic real polynomials of degrees , respectively. Its original domain excludes exactly and . At its graph has a removable hole, and at it has a vertical asymptote. Its slant asymptote is , and .
Determine and . Find the height of the hole, and determine whether that height is attained anywhere else on the original graph. Justify uniqueness.
- Hint 1
The degree and domain determine . Cancel the factor responsible for the hole, then use polynomial division and the slant asymptote.
- Hint 2
The reduced expression must have the form . Use the given zero to find , and then solve for the height of the hole using the original domain.
Answer
, . The hole is at , and its height is also attained at .
Full solution
Because is monic of degree with exactly the two real zeros , it must equal .
The removable hole forces the factor to cancel.
After this cancellation, division of the remaining monic quadratic by gives a linear quotient and a constant remainder.
The slant asymptote fixes the quotient as , so the reduced expression is .
The condition gives , hence .
Therefore the reduced numerator is , giving the claimed .
Its value at is nonzero, so the specified vertical asymptote really occurs.
At the excluded input , the reduced formula has value .
To see whether this output is lost altogether, solve
After multiplying by the nonzero , the equation becomes
The first root is excluded, but is permitted.
Thus the hole removes one point without removing its height from the range.
Each coefficient was forced in order, proving uniqueness.
Answer
, . The hole is at , and its height is also attained at .
Key idea
A hole removes an input-output pair; it removes an output only if that output has no other preimage.
- Hint 1
-
Problem 4 Returning after four steps
Difficulty: 2 of 3 stars, Challenge
Let for real . Starting from a real input , apply repeatedly, stopping if an input of occurs.
Find exactly which starting values allow four applications. For every such starting value, determine , where means four successive applications. Prove that the first return to the starting value occurs after exactly four applications.
- Hint 1
Compute the iterates one at a time. At each step, exclude inputs using the preceding expression before canceling factors.
- Hint 2
The second iterate simplifies to , but it retains exclusions from the first step. Check returns after one, two, and three applications separately.
Answer
Four applications are possible exactly for . On this set, , and the first return is always at step .
Full solution
The first application requires .
For a second application, must also differ from ; solving gives .
On the remaining domain,
A third application fails exactly when , or .
Otherwise
For a fourth application, this last value must differ from .
The equality would imply , so it introduces no new exclusion.
Direct substitution now gives for precisely the domain .
A return after one application would satisfy , which reduces to .
A return after two would satisfy , again giving .
A return after three would give , with the same impossible real equation.
Thus no earlier return occurs.
In particular, the simplified formula cannot be used to restore the three inputs at which the original four-step process breaks down.
Answer
Four applications are possible exactly for . On this set, , and the first return is always at step .
Key idea
The domain of an iterate records every intermediate denominator, even if its final formula is simple.
- Hint 1
-
Problem 5 Integer outputs of a rational function
Difficulty: 2 of 3 stars, Challenge
Find every integer for which
is an integer. Give all resulting integer outputs, and prove that no integer input is missing.
- Hint 1
Write and divide the numerator by the denominator.
- Hint 2
If divides , use the identity to show that divides .
Answer
The inputs are . The outputs are for the first three, at , and for the last three.
Full solution
The denominator is , so every real input is in the domain.
Let .
The numerator becomes , and division gives
For integer , the output is an integer exactly when divides .
Write .
If divides , it divides as well.
It also divides , so it divides their difference
Conversely, if divides , then it certainly divides .
Thus the integrality condition is equivalent to being a positive divisor of .
These divisors are , giving and
Subtracting gives precisely the seven listed inputs.
At , the formula gives each time.
It is odd as a function of , giving at the three negative values, and at .
The divisibility equivalence supplies the required finite completeness argument.
Answer
The inputs are . The outputs are for the first three, at , and for the last three.
Key idea
Polynomial division can reduce integrality to divisibility, and a coprime denominator can sharply bound the search.
- Hint 1
-
Problem 6 A rational expression on a triangle
Difficulty: 2 of 3 stars, Challenge
Positive real numbers satisfy . Prove the sharp bounds
Identify every equality case for the lower bound. Prove that the upper bound cannot be replaced by any smaller number, even though it is never attained.
- Hint 1
Use a common denominator and abbreviate and .
- Hint 2
The expression simplifies to . Prove by expanding and pairing reciprocal ratios.
Answer
The bounds hold. Equality at occurs only when ; the upper bound is unattained but sharp.
Full solution
All three numbers lie in , so every denominator is positive.
With and , the common denominator is and the numerator is .
Thus
To prove the lower bound, expand .
Each paired sum is at least , since
Therefore
It follows that
Equality requires equality in every paired ratio, so exactly works.
For sharpness above, take and , with .
Then and , yielding
Its positive deficit below is smaller than .
Given any , choose ; then
This proves sharpness without claiming an unattainable equality.
Answer
The bounds hold. Equality at occurs only when ; the upper bound is unattained but sharp.
Key idea
Distinguish an attained maximum from a sharp upper bound approached by valid inputs.
- Hint 1
-
Problem 7 Lines meeting a rational curve
Difficulty: 2 of 3 stars, Challenge
For real , count the distinct real intersections of the line with the curve , whose domain is . Give a complete classification in terms of , including every line with exactly one intersection. Explain the exceptional behavior when .
- Hint 1
Clear only after recording the excluded input, and check whether that input could become a root.
- Hint 2
When , the discriminant can be written as . Handle before using a quadratic formula.
Answer
For : always two intersections. For , put and : zero if , one if , two if . For : zero if , and one otherwise.
Full solution
Equating the two formulas and clearing the nonzero denominator gives
At the left side equals , so the forbidden input can never be a root.
Counting roots of this polynomial therefore counts the curve-line intersections exactly.
If , the equation becomes
It has no solution when , and exactly one, , otherwise.
The excluded line is the slant asymptote: division gives , whose remainder term never vanishes.
If , the discriminant is
For it is strictly positive, giving two intersections for every intercept.
For , set and
The discriminant is , which is negative, zero, or positive according as , , or .
This proves the full classification.
In particular, slopes below have exactly two intercepts producing a single intersection, while slope has infinitely many such intercepts because the equation drops degree.
Answer
For : always two intersections. For , put and : zero if , one if , two if . For : zero if , and one otherwise.
Key idea
A discriminant classifies intersections only after degree changes and forbidden inputs have been checked.
- Hint 1
-
Problem 8 Rational sums at unknown cubic roots
Difficulty: 3 of 3 stars, Deep challenge
Let be the three real zeros of . Without finding them individually, evaluate
Explain why both sums are defined, and show the symmetric-sum calculations behind your answer.
- Hint 1
Vieta gives , , and . Compute and .
- Hint 2
Use the common denominator . For the numerator of , separate the degree-five terms, the six degree-three terms, and the linear terms.
Answer
and .
Full solution
The zeros are real, so each denominator is positive.
Vieta gives , , and .
Consequently, and
The common denominator is .
The numerator of is .
For , the numerator is .
Its degree-five terms sum to
The six degree-three terms sum to
Its linear terms sum to .
Thus the numerator is , proving both values.
This computation uses only symmetric information and never requires choosing an order for the three roots.
Answer
and .
Key idea
For rational sums at polynomial roots, expand the common denominator in symmetric pieces before attempting individual root formulas.
- Hint 1
-
Problem 9 Where should the improvement go?
Difficulty: 3 of 3 stars, Deep challenge
An idealized process has three sequential stages. If nonnegative amounts of improvement are assigned to them, its total time is modeled by
Find the minimum possible time and every minimizing allocation in each case: (a) ; (b) . Prove global optimality without calculus. Explain why the optimal allocation gives nothing to one stage in one case but improves all three stages in the other.
- Hint 1
Set , so . The weighted reciprocal inequality follows from a square.
- Hint 2
For part (a), first use . Then compare to on . For part (b), use .
Answer
(a) Minimum at only. (b) Minimum at only.
Full solution
For positive and nonnegative , direct expansion gives
Equality requires when .
The three-term version follows by adding the analogous three pairwise squares; equality requires the three denominators to be proportional to the three numerator square roots.
For part (a), and each is at least , so
The two-term inequality gives
Subtracting yields on this interval.
Equality forces , followed by .
Since , this gives , and hence
All entries are feasible.
For part (b), , so the three-term inequality gives
Equality requires , hence and
The lower bound prevents using the same unconstrained proportion in part (a): with total , it would require .
The boundary constraint is therefore essential, rather than a detail to check after optimizing.
Answer
(a) Minimum at only. (b) Minimum at only.
Key idea
A sharp unconstrained inequality may suggest an infeasible equality case; optimize again on the active boundary.
- Hint 1
-
Problem 10 Zeros between vertical asymptotes
Difficulty: 3 of 3 stars, Deep challenge
Let be real numbers, with , and let be positive real weights. For a real constant , consider
Prove that there is exactly one solution in every interval . Determine how many additional real solutions occur outside for , , and , and locate them.
You may use that a continuous graph which takes values on both sides of a target height must reach that height somewhere between those inputs.
- Hint 1
On an interval containing no pole, compare the expression at two inputs by subtracting corresponding fractions.
- Hint 2
Near the left endpoint of an interior interval one term grows positively without bound, while near the right endpoint one grows negatively without bound. On each exterior interval, all denominators have the same sign.
Answer
Each of the interior intervals contains one solution. If , there are no others. If , there is one additional solution in ; if , one in .
Full solution
Write the left side as .
If belong to the same pole-free interval, then : the two denominator factors have the same sign.
Adding proves , so each such interval contains at most one solution.
On , the term becomes arbitrarily large and positive near the left endpoint, while the other terms stay bounded there.
Near the right endpoint, becomes arbitrarily negative while the others stay bounded.
Thus some two interior inputs have values above and below any given .
Continuity gives a solution, and strict decrease gives uniqueness.
For , every term is positive.
The sum becomes arbitrarily large near and approaches as increases without bound.
Therefore it reaches each positive exactly once and never reaches a nonpositive .
For , every term is negative; the sum approaches from below as decreases without bound, and becomes arbitrarily negative near .
It reaches each negative exactly once and no nonnegative .
These intervals exhaust the permitted real domain, proving the full count.
Answer
Each of the interior intervals contains one solution. If , there are no others. If , there is one additional solution in ; if , one in .
Key idea
Positive weights and pole locations can determine every real solution count without expanding a high-degree numerator.
- Hint 1