Proving a "for all" statement with examples
Checking (or a thousand values) proves nothing about every . Use a general element, such as with , so the argument covers every case at once.
Specialist Mathematics · Unit 1 · Topic 2
The language and methods of proof. Number sets and set notation, implication, converse, contrapositive and negation, quantifiers, counterexamples, direct proofs with integers, recurring decimals and proof by contradiction.
Name the number systems , , , , and , decide which sets a number belongs to, and write membership with and .
Recognise statements, write their negations, and read, write and negate statements that use "for all" (∀) and "there exists" (∃).
Write the converse and contrapositive of an implication, decide which must be true, and use , and correctly in mathematical working.
Disprove a "for all" statement with a single counterexample, prove a "there exists" statement with a single example, and see why examples alone never prove a general result.
Prove results about odd, even and consecutive integers and divisibility by writing a general integer algebraically and reasoning step by step to the conclusion.
Prove results for every integer by splitting into cases such as odd and even, and prove an implication by proving its contrapositive instead.
Explain why every fraction gives a terminating or recurring decimal, predict which, and convert recurring decimals back into fractions in lowest terms.
Prove a statement by assuming it is false and reaching something impossible, and use the method to prove that , and numbers built from them are irrational.
Ten questions across the topic, from foundation to complex unfamiliar. Your results feed your mastery.
Check that is prime for and you will find it is, every time. Is it prime for every positive integer ? No: at it equals . Thirty-nine examples did not prove the statement, but one counterexample was enough to disprove it.
That is what this topic is about: how mathematicians know something is true for every case, not just the cases they have checked. You will learn the precise language of proof (number sets, implication, converse, contrapositive, negation and the quantifiers and ), then the methods: direct proof, proof by cases, proof using the contrapositive and proof by contradiction. You will use them to prove facts about odd and even numbers, about divisibility, about decimals, and finally that is irrational.
Proof runs through the rest of Specialist Mathematics, from circle and vector proofs in Unit 2 to induction in Unit 3. The habits you build here, defining every letter, justifying every step and finishing with a conclusion, are what earn the marks there too.
Subject matter from the Specialist Mathematics General senior syllabus 2025 v1.4 (opens in a new tab), CC BY 4.0 © State of Queensland (QCAA).
The focus areas you can practise on their own. Each one maps to dot points above.
Number sets and notation
Classify numbers as elements of ℤ⁺, ℤ⁻, ℤ, ℚ, ℚ′ and ℝ, and read and write statements with ∈ and ∉.
Negation and quantifiers
Read and write statements with ∀ and ∃, and negate statements, including quantified ones.
Implication, converse and contrapositive
Write the converse and contrapositive of P ⇒ Q, and decide which of them must be true.
Equivalence and logical symbols
Use ⇒, ⇔ and = correctly, and recognise when a statement is an "if and only if".
Examples and counterexamples
Disprove a "for all" statement with one counterexample, and prove a "there exists" statement with one example.
Direct proof with integers
Prove results about odd, even and consecutive integers and divisibility by writing them as 2k, 2k + 1 and so on.
Proof by cases
Prove a result for every integer by splitting into cases, such as n even and n odd, or remainders on division by 3.
Proof using the contrapositive
Prove P ⇒ Q by proving not Q ⇒ not P, for example "if n² is even then n is even".
Rational numbers as decimals
Decide whether a fraction terminates or recurs, convert fractions to decimals, and convert recurring decimals to fractions.
Proof by contradiction
Assume the statement is false, reason to something impossible, and conclude that the statement is true.
Proving irrationality
Prove numbers such as √2, √3 and 2 + √5 are irrational by contradiction.
Checking (or a thousand values) proves nothing about every . Use a general element, such as with , so the argument covers every case at once.
For "the sum of two odd numbers is even", write and . Writing both as only proves it when the two numbers are equal.
For , the converse swaps the parts (); the contrapositive swaps and negates them (). Only the contrapositive is guaranteed to have the same truth value.
The negation of "all swans are white" is "there exists a swan that is not white", not "no swans are white".
joins statements, never expressions. Write , not .
, but , because could be . Check both directions before writing .
is a fraction, but it does not show is rational: the definition needs integers and .
A proof by contradiction must say what is being assumed ("Suppose is rational"), point to the contradiction exactly, and finish with a conclusion. Markers look for all three.
The contradiction in the proof is that and are both even. That only contradicts something if you assumed was in lowest terms.
If then , so . A recurring decimal is an exact number, not an approximation.
"Prove" and "show that" questions are marked on the reasoning. State what each letter represents (for example "let , where "), justify each step and end with a sentence that answers the question.
Finish an integer proof by writing the result in the required form and saying why: " is odd, since ."
To disprove a statement, one specific counterexample with the calculation shown is a complete answer. Say clearly that it satisfies the hypothesis and fails the conclusion.
In a proof by contradiction, label the parts: "Assume, for contradiction, …", then "This contradicts …", then "Hence …".
When asked for a converse or contrapositive, write the full statement in words or symbols, then answer any "is it true?" part separately with a proof or a counterexample.
For recurring decimals, show the subtraction: multiply by the right power of 10 so the repeating parts line up, subtract, solve and simplify the fraction.
Use between lines of working only when each line really follows from the one before, and only between equal quantities.
Computer science: proofs that an algorithm always terminates or always gives the right answer, and the logic of if–then statements in code.
Cryptography: the security of online banking rests on proven facts about primes and divisibility.
Law and argument: the difference between a statement and its converse ("all thieves were at the scene" does not mean "everyone at the scene is a thief").
Engineering and safety: a single counterexample, one failed test, is enough to show a design does not always work.
Measurement: the diagonal of a 1 m square tile is m, a length that can never be written exactly as a fraction of a metre.