Special 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 Distances hidden under square roots
Difficulty: 1 of 3 stars, Stretch
Find all real solutions of . Then find all solutions when the right side is changed to . Explain why one equation has finitely many solutions while the other has an interval of solutions.
- Hint 1
For real , the principal square root of is , not necessarily .
- Hint 2
Interpret the two terms as distances from to the points and on a number line.
Answer
For right side : . For right side : every .
Full solution
The principal square roots are nonnegative, so the left side is .
It is the sum of the distances from to and to , which are five units apart.
If , those distances add to
If , their sum is
If , their sum is
To obtain , must lie outside the interval and be two units from its nearer endpoint.
This gives or ; both check directly.
To obtain , every point inside the interval works, while an outside point adds a strictly positive extra distance.
Hence exactly the closed interval is the second solution set.
The interval arises because moving within it increases one distance by exactly as much as it decreases the other.
Answer
For right side : . For right side : every .
Key idea
Square roots of squares encode distances; a geometric interpretation can reveal entire intervals of solutions.
- Hint 1
-
Problem 2 A floor and a ceiling disagree
Difficulty: 1 of 3 stars, Stretch
Find all real numbers satisfying . Here is the greatest integer at most , and is the least integer at least . State exactly which endpoints belong to the solution set.
- Hint 1
Write , where is an integer and .
- Hint 2
The equation becomes . The ceiling can be , , or , with different endpoint rules.
Answer
.
Full solution
Write , where is an integer and .
Because is integral,
Thus the equation is
There are exactly three cases.
If , then , which would require , impossible for integer .
If , then , giving .
If , then , which would require , also impossible.
Therefore with , or .
The lower endpoint fails because at the left side is .
The upper endpoint works because at it is .
The three fractional-part cases cover negative as well, so no additional intervals have been overlooked.
Answer
.
Key idea
Separate a real input into its integer and fractional parts, and preserve endpoint inequalities through each floor or ceiling.
- Hint 1
-
Problem 3 A canceled factor leaves a missing output
Difficulty: 1 of 3 stars, Stretch
The function has its original real domain. Find all such that . Then determine the complete range of , explaining any effect of the canceled factor.
- Hint 1
Factor numerator and denominator, but write the original excluded inputs before canceling.
- Hint 2
For a proposed output , solve for , then check whether that input is allowed.
Answer
only at . The range is .
Full solution
The original denominator factors as , so .
For those allowed inputs, cancellation gives
Setting this equal to yields , hence , which is allowed and works.
For the range, let
If , this would require , impossible.
If , the unique candidate input is
It never equals , because that equality would give .
It equals exactly when , or .
Thus outputs and are impossible.
Conversely, for every other real , the displayed input is real, avoids both excluded values, and gives .
This proves the complete range.
The missing value is the output that the simplified formula would assign at the removed input .
Answer
only at . The range is .
Key idea
Cancellation preserves values only on the original domain; reconstructing inputs detects missing outputs.
- Hint 1
-
Problem 4 When a weight moves the best location
Difficulty: 2 of 3 stars, Challenge
For real and a positive real parameter , let . For every , find the minimum value of and every input attaining it.
Identify the weight at which the set of best locations changes, and explain why an entire interval is optimal at that weight.
Builds on Absolute Value Equations and Graphs, Piecewise Functions
- Hint 1
The breakpoints remain , , and , regardless of .
- Hint 2
Find the coefficient of in each linear branch. On , its sign depends on ; outside that interval the direction of change does not.
Answer
If , the minimum is , attained only at . If , the minimum is , attained for every . If , the minimum is , attained only at .
Full solution
The expression is linear on the intervals cut by .
On the far-left interval its coefficient of is , so the value decreases as moves toward .
On , the coefficient is , and on the far-right interval it is .
Thus the value strictly increases after .
Every minimum must lie in .
For , expanding the absolute values gives
If , this decreases strictly, so its unique minimum is at , with value .
If , it increases strictly, so its unique minimum is at , with value .
At the threshold , the coefficient of vanishes and the whole interval has value .
The outer intervals are strictly worse, so this is the full set of minimizers.
Moving within increases the weighted distance from at rate while decreasing the other two weighted distances at combined rate .
They cancel exactly at the threshold.
Answer
If , the minimum is , attained only at . If , the minimum is , attained for every . If , the minimum is , attained only at .
Key idea
In a piecewise linear optimization problem, parameter thresholds occur when a branch changes its direction of increase.
- Hint 1
-
Problem 5 Coupled radicals in sum-and-difference coordinates
Difficulty: 2 of 3 stars, Challenge
Find all ordered pairs of real numbers satisfying both equations
Use principal, nonnegative square roots. Prove completeness and check each candidate in both original equations.
- Hint 1
The repeated expressions and suggest new variables. What signs do the original equations force on them?
- Hint 2
Put and . The squared equations are and . Keep the possibility before dividing by .
Answer
The only ordered pairs are and .
Full solution
Set and .
The first original equation requires and gives
The second also has nonnegative sides.
Thus both new variables must be nonnegative, and squaring gives and .
Substitution yields , or
One possibility is , which then gives .
Otherwise , so division by is valid and gives .
Its only nonnegative solution is , followed by .
There are no negative branches because the original square roots already forced .
The change of variables is reversible: and .
The two possibilities become and .
At both equations read .
At the first reads , and the second reads
Both are valid.
Every original solution led to one of the two cases, so the list is complete; dividing by at the start would have lost the first pair.
Answer
The only ordered pairs are and .
Key idea
Use repeated combinations as coordinates, and retain zero cases before division in a radical system.
- Hint 1
-
Problem 6 Divisibility inside square-root blocks
Difficulty: 2 of 3 stars, Challenge
How many integers with are divisible by ? Find a structural description of all such , and then give the count for , where is any positive integer.
- Hint 1
Group inputs according to . What interval of integers has the same ?
- Hint 2
Within , list the multiples of . The final block at is incomplete.
Answer
There are for . In general the count is ; full blocks contribute .
Full solution
For any positive integer , set
Its block is
If is a multiple of , write and divide these inequalities by :
The integer choices are exactly
This remains true at , where the upper bound is the strict inequality .
Hence every full block contributes exactly , and these numbers all lie in their designated block.
Up to , the blocks are complete and contribute numbers.
The last block, , contributes only itself.
Distinct blocks do not overlap, so the total is
This formula also gives when , correctly counting just .
Taking gives .
Answer
There are for . In general the count is ; full blocks contribute .
Key idea
A floor of a square root is constant between consecutive squares; count within those blocks before summing.
- Hint 1
-
Problem 7 Returning after two folds
Difficulty: 2 of 3 stars, Challenge
On , define for , and for .
Find all for which . Identify which of these return after one application and which form a genuine two-step cycle.
Text description of this figure
Axes labeled x and T of x, with a light square grid in steps of one half over the unit square. The graph of T is a tent made of two straight segments: it rises from the origin to a peak of height 1 at x equals one half, then falls back to height 0 at x equals 1. Dots mark the two ends and the peak. The horizontal axis is marked at 0, one half and 1, and the vertical axis at 1.
Builds on Piecewise Functions
- Hint 1
The formula used on the second application depends on whether is at most .
- Hint 2
The needed breakpoints are . Compute on each resulting interval and check the interval for every candidate.
Answer
The solutions are . The fixed points are ; the genuine cycle is .
Full solution
The output of stays in , so the second application is always defined.
On , the first output is , giving
On , it is , giving
Both formulas agree at .
On , the first output is , so the second output is
On , the first output is at most , so the second output is
Adjacent formulas also agree at and .
Equating each formula to gives, respectively,
Every candidate belongs to the interval used to obtain it, so all four work and there are no others.
Directly, and , while and
Thus two are fixed points, and the other two exchange places in a genuine two-step cycle.
Answer
The solutions are . The fixed points are ; the genuine cycle is .
Key idea
When composing a piecewise function, split at preimages of the original breakpoints as well as at the breakpoints themselves.
- Hint 1
-
Problem 8 A radical equation with a moving target
Difficulty: 3 of 3 stars, Deep challenge
For every real , find all real solutions of . Classify when there are zero, one, or two distinct solutions, and give exact formulas for the solutions when they exist.
- Hint 1
The domain is , and the two radicands have constant sum . First bound the possible value of their square-root sum.
- Hint 2
After one squaring, isolate the nonnegative product of the radicals. The identity can simplify the second step.
Answer
No solutions for or ; one solution at ; two solutions for . The formula is .
Full solution
The domain is .
Write and , so and
Consequently
Also implies , so
Since the sum is nonnegative, necessarily
For such a , the equation gives
Squaring and using yields
Therefore , producing the stated two candidate formulas.
We must check the squaring.
For the allowed , lies between and .
Thus the candidates satisfy , or
Their product of radicands gives
Hence and, with both sides nonnegative, .
Every candidate is valid.
The candidates coincide only when , giving the single solution at
At every smaller allowed they are distinct; in particular gives both endpoints .
Answer
No solutions for or ; one solution at ; two solutions for . The formula is .
Key idea
Bound the output before squaring, then use those bounds to verify every candidate and count merged branches.
- Hint 1
-
Problem 9 Which integers does a step function skip?
Difficulty: 3 of 3 stars, Deep challenge
Define for every real . Determine exactly which integers occur as outputs. For every integer that occurs, give the full set of real solutions of . Your classification must include negative inputs and all interval endpoints.
Builds on Piecewise Functions
- Hint 1
Write with integer and . Then .
- Hint 2
The fractional-part formula changes at . Analyze those points separately when needed, then classify by its remainder upon division by .
Answer
Exactly the integers not congruent to modulo occur. Write uniquely with and . For , the solution sets are respectively , , , , and ; for the set is empty.
Full solution
For every real , including negative , write with and .
Integer shifts pass through floors and ceilings, giving , where
At , .
For , the floor is and the ceiling is , so .
For , they are , so .
For , they are , so .
Finally, for , they are , so .
These cases cover every allowed without overlaps.
Every integer has a unique expression with integer and remainder , even when is negative.
Since takes only values through , the remainder is impossible.
For the other remainders, the equality forces and the corresponding listed fractional-part interval.
Adding gives exactly the solution sets in the answer.
Each nonempty set supplies actual inputs, proving attainability as well as exclusion.
Answer
Exactly the integers not congruent to modulo occur. Write uniquely with and . For , the solution sets are respectively , , , , and ; for the set is empty.
Key idea
An integer-plus-fractional-part decomposition can classify the entire range and every level set of a step function.
- Hint 1
-
Problem 10 When a rational function reaches every height
Difficulty: 3 of 3 stars, Deep challenge
For real , let with domain . Find all parameters for which every real number is an output of . Prove both directions.
For each boundary parameter of your answer, determine the exact range of , taking account of any canceled factor.
- Hint 1
If every output is possible, output must be possible. Examine the numerator and its roots.
- Hint 2
For an arbitrary target , rearrange as . Handle separately, and make sure any quadratic roots avoid .
Answer
Every real output occurs exactly when . At both boundary values and , the range is .
Full solution
For output , the numerator must vanish at an allowed input.
Its discriminant is .
If , it has no real root.
If , its only root is ; if , its only root is .
Both are forbidden.
Hence reaching every real output requires .
Now assume and choose any real target .
For , the equation is quadratic with discriminant
It has real roots.
Substituting into its left side gives , and substituting gives ; neither is zero.
Thus its roots are allowed and give output .
If , the equation is linear: , giving .
This also avoids because .
Every target is therefore reached.
At , cancellation gives while still excluding both .
Output is impossible, and output would require the removed input .
For any , the input is allowed and gives that output.
At , the simplified form is , with the same exclusions.
For , the input works and avoids both forbidden inputs.
Thus both boundary ranges omit exactly and .
Answer
Every real output occurs exactly when . At both boundary values and , the range is .
Key idea
Test a necessary output first; then prove full range by solving for an arbitrary target and checking degenerate equations and excluded inputs.
- Hint 1