Assessment and exam practice.

Try this with Mathematics Methods

1. Check the task format, time limit and permitted materials with your school.
2. Start with one timed section or task and record where you spent the most time.
3. Review errors before attempting another section. Separate missing knowledge from timing problems.

View Mathematics Methods resources on ATARMAXXING ↗

Practice paper focus areas

• Exam 1 — Restricted logarithms, inverses and piecewise bijections; Exact circular values and phase-sensitive thresholds; Smooth joins, contact geometry and constrained extrema
• Exam 2 — Reciprocal holes and composition range restrictions; Tangent branches and complementary-angle equations; Derivative graph reconstruction from piecewise motion
• Exam 3 — Polynomial multiplicity and exponential intersections; Period inference from nonconsecutive events; Optimisation with active endpoint constraints
• Exam 4 — Logarithmic parameter recovery and inverse restrictions; Circular equation completeness on negative domains; Nonroutine tangent lines through an external point
• Exam 5 — Power-graph transformations and piecewise continuity; Reconstructing circular models from quarter-cycle data; Differentiability conditions with two unknown coefficients
• Exam 6 — Factor theorem with unknown coefficients and composition; Exact quadrant identities and tangent asymptote selection; Cost minimisation with a restricted feasible interval
• Exam 7 — Exponential baseline decay and maximal domains; Changed-period models with a fixed midpoint event; Local and absolute extrema on open and closed intervals
• Exam 8 — Inverse-square ranges and cancellation restrictions; Trigonometric equations reduced by factorisation; Product-rule motion and speed-direction distinctions
• Exam 9 — Composed logarithms and polynomial level sets; Periodic duration within a clipped observation window; Parameterised normals and horizontal-tangent exceptions
• Exam 10 — Function reconstruction from roots and a nonzero datum; Equivalent sine/cosine forms under phase constraints; Optimisation of a folded-sheet design
• Exam 11 — Restricted inverses with nontrivial output sets; Exact circular equations spanning multiple rotations; Derivative sign charts with stationary inflections
• Exam 12 — Exponential threshold inequalities and model validity; Tangent transformations combined with finite domains; Tangent approximation and error-direction reasoning
• Exam 13 — Polynomial inequality intervals including isolated roots; Recovering angular frequency from alternating extrema; Slope-matching equations with multiple contact points
• Exam 14 — Logarithm base changes and inverse point mapping; Circular graph parameters from a table and crossing direction; Motion with a stationary time but no reversal
• Exam 15 — Composite function feasibility in a practical domain; Phase shifts preserving a specified peak after period change; Endpoint optima arising from an added design constraint
• Exam 16 — Rational graph holes versus vertical asymptotes; Trigonometric identity domain restrictions and exact sums; Piecewise derivative existence and local rate comparisons
• Exam 17 — Model parameters from unequal observation times; Threshold crossing families and overlapping cycles; Quotient-rule critical points with rejected roots
• Exam 18 — Hybrid function inverses and graph endpoint inclusion; Periodicity proof and alternative phase representations; Combined-rule optimisation of an exponential product
• Exam 19 — Polynomial and logarithmic domain intersections; Circular parameter recovery with a sign-ambiguous amplitude; External-point tangency and uniqueness arguments
• Exam 20 — Integrated function study with inverse and limit behaviour; Nonroutine circular modelling with all event checks; Global optimisation and a complete particle-motion account