Functional Equations
Puzzles that describe a function only through a rule it obeys — like f(x+y) = f(x) + f(y) — solved by plugging in clever special values rather than by algebra alone.
Prerequisites: The Substitution That Collapses the Algebra
You're told a function satisfies for all real , and that . Find and . There's no formula for written down anywhere — just a rule it must obey for every pair of inputs. That "for all" is the whole game: since the rule holds for every possible and , you're free to plug in whatever specific values expose the most information, and a few well-chosen substitutions pin the function down completely.
The idea: plug in the values that break the equation open
A functional equation is really an infinite family of ordinary equations, one for each choice of and . Most of those choices are useless, but a few specific ones — zero, equal inputs, one input replacing another — tend to make terms cancel or repeat in a way that reveals structure. The standard menu:
- Set to find .
- Set to relate to .
- Set to relate to and .
- Look for a pattern and guess the general form, then verify it satisfies the original equation for all inputs, not just the ones you tested.
In plain English: you're using the universality of the rule against itself, extracting a normal, solvable equation from a statement that otherwise has no single unknown to isolate.
Worked example 1: additive functions
With and , set : , so . More directly, set again — i.e., by applying the rule twice, so . Once is known, (ten times) — repeated application of the same rule. This is the signature of additive functional equations: for integer , i.e. behaves like multiplication by a constant, .
Worked example 2: finding f(0) and checking a guess
Suppose for all real , with . Setting : , so is or ; if then setting generally forces everywhere, a degenerate solution, so take . Guessing (since matches the rule exactly, and matches the given value), check it satisfies both the equation and — it does. So , , read straight off the verified formula rather than solved case by case.
A functional equation is a rule that holds for all inputs — exploit that by substituting special values (zero, equal arguments, negatives) to extract concrete facts, then guess and verify a closed-form solution against the original equation, not just the cases you tested.
Finding a formula that fits every substitution you tried is not a proof it's the only solution, or even a valid one — you must plug the candidate back into the original equation for arbitrary to confirm it, since functional equations can admit multiple solutions (or none, without extra regularity assumptions like continuity).
Related concepts
Practice in interviews
Further reading
- Engel, Problem-Solving Strategies, ch. 4