Students write precise algorithms that test divisibility or generate number sets, trace inputs through decisions, use digital tools for repeated cases and distinguish observed patterns from proven rules.
An algorithm needs ordered steps, complete decision branches and a defined output for every valid input.
Stopping at the square root avoids retesting reversed factor pairs, but every recorded factor below the root must be paired with n ÷ d.
A table or program can reveal patterns quickly. Test counterexamples and use number properties before stating a generalisation.
Learning routine: Represent → Reason → Calculate → Interpret → Verify
Success looks like
- Represent the problem
- Choose an efficient strategy
- Calculate accurately
- Interpret the context
- Estimate or use an inverse to verify