Function machines are often introduced as simple boxes: put a number in, apply a rule, get a number out. The picture can look elementary, but it contains the core logic of functions, algebraic substitution, inverse operations and composition.
This guide uses function machines as an early bridge into formal function thinking. The aim is to move from “do this to a number” toward a stable understanding of input, process, output, reversibility and chained transformations.
The machine idea
Suppose the machine rule is “multiply by 3, then add 2”.
input x → ×3 → +2 → output 3x+2If x=4, the output is 14. If x=-2, the output is -4.
Why order matters
“Multiply by 3, then add 2” is not the same as “add 2, then multiply by 3”.
x → ×3 → +2 gives 3x+2
x → +2 → ×3 gives 3x+6The machine representation makes operation order visible before formal function composition is introduced.
Worked example 1: build the rule from a machine
A machine doubles the input and subtracts 5. Write the output expression.
x → 2x → 2x-5The rule is 2x-5.
Worked example 2: recover the input
The same machine produces output 13. What was the input?
2x-5=13
2x=18
x=9Thinking backward through the machine gives the same result: add 5, then divide by 2.
Forward rules and inverse operations
If the forward machine is “×4 then +7”, the reverse sequence is “−7 then ÷4”. Notice that inverse operations are applied in reverse order.
This prepares students for solving equations and later inverse functions.
Chaining machines
Suppose Machine A adds 3 and Machine B squares the result. Starting from x:
x → x+3 → (x+3)²Changing the order changes the result:
x → x² → x²+3This is the concrete beginning of composite-function thinking.
From table to rule
Consider:
| Input | Output |
|---|---|
| 1 | 5 |
| 2 | 8 |
| 3 | 11 |
| 4 | 14 |
The output rises by 3 whenever the input rises by 1, suggesting a rule with coefficient 3. Testing 3x+2 gives all four outputs.
Function-machine thinking therefore connects patterns to algebraic generalisation.
From words to function notation
Once the machine idea is stable, formal notation becomes less mysterious.
f(x)=3x+2This is simply the machine rule written compactly. f(5) means “send 5 through this machine”.
Why some machines cannot be reversed uniquely
Consider the machine x→x². Both 3 and -3 produce 9. If the output is 9, the original input cannot be identified uniquely unless the permitted inputs have been restricted.
This is the first hint that inverse functions require careful domain choices.
Diagnostic table
| Observed mistake | Likely issue | Repair |
|---|---|---|
| Reverses operations but not order | Inverse-sequence logic | Trace one numerical input backward |
| Changes machine order without noticing | Composition order | Write each intermediate output |
| Cannot turn machine into algebra | Representation gap | Use x as a general input |
| Assumes every machine reverses uniquely | Many-to-one mapping | Use x² as counterexample |
A tutor’s teaching route
- Begin with numerical inputs and a verbal rule.
- Record intermediate steps.
- Replace the number with x.
- Reverse the process to recover inputs.
- Chain two machines in both possible orders.
- Introduce f(x) notation as a compression of the same process.
Practice
- A machine multiplies by 5 then subtracts 4. Find the output when input is 3.
- The same machine gives output 21. Find the input.
- Write the algebraic rule for “add 2, then square”.
- Explain why x→x² cannot always be reversed to one unique input.
Answers
1. 11. 2. 5. 3. (x+2)². 4. Different inputs such as 3 and -3 can produce the same output 9.
Connected routes
Use What a Function Really Is for the formal definition, then continue to Domain, Range and Restrictions and Composite and Inverse Thinking Before Additional Mathematics. Return to the Mathematics Learning Hub.