The Maths TailorPast-paper stats

TMUAProof & Number TheoryRank #76·Type MC

Find the flawed step by hunting the unjustified leap, especially the 'multiple of 3 could be 3' and 'no remainder bound' traps

At a glance

3

Occurrences

questions

3

Years

3

Papers

3

Worked

100%

When this method shows up

Years in which at least one question on this paper triggers the method.

Other top methods in Proof & Number Theory

To break a universal claim, test the explicit small cases and read off the counterexample×4
Rewrite every number in its prime factors, then argue on the exponents (sign for integer, parity for square)×3
Force the search to be finite, then enumerate: bound a variable or count the worst case×3

See the worked examples

Open this method in the 3-panel methods app to see the demonstration, every linked past-paper question, and how to attack it.

Open method in the TMUA app

Try a method on a real paper

Open the TMUA methods app to see worked examples, linked questions and the 3-panel revision view.

Open TMUA methods