How to Learn Mathematical Proofs Quickly and Correctly

To learn Mathematical Proofs quickly and correctly, begin with a simple distinction: getting the right answer to one example is not the same as proving that a statement is always true. A proof starts from precise definitions and accepted facts, then explains why each step follows logically. You do not need long or complicated writing to begin. You need to understand exactly what is being claimed, what conditions it assumes and whether the conclusion holds for every permitted case. These eduKateSG Mathematics Quick Notes teach short, readable proofs and show how to spot a false claim with a counterexample.

Read the claim: identify what must be shown and which numbers or objects it concerns.
Use definitions: an even integer is 2k; an odd integer is 2k + 1 for some integer k.
Choose a method: direct reasoning, cases or a counterexample when testing a false universal claim.
Explain every step: name the algebraic rule or mathematical fact used.
Keep conditions: do not divide by zero or assume unproved properties.
Conclude clearly: show why the result follows for all permitted cases.

First, read a mathematical statement as carefully as you would read a question in English. Consider the claim “the sum of two even integers is even”. It does not say only that 2 + 4 = 6 or 8 + 10 = 18. It says every pair of even integers has an even sum. The word every changes what evidence you need. Checking a hundred examples may build confidence, but it does not establish a universal claim. A proof needs reasoning that works for any integers satisfying the conditions.

Second, turn the words into definitions. By definition, an even integer can be written as 2a for some integer a. Another even integer can be written as 2b for some integer b. Their sum is 2a + 2b = 2(a + b). Since a + b is also an integer, the sum is twice an integer. Therefore the sum is even. That is a complete short proof: we stated the general form, combined the expressions using algebra and returned to the definition. We did not need to choose particular numerical examples.

Third, learn to distinguish proving a true universal statement from disproving a false one. To show that the claim “every prime number is odd” is false, you need only one counterexample: 2 is prime and even. The example defeats the universal claim. But listing the odd primes 3, 5, 7 and 11 cannot prove that every prime is odd, because those examples do not cover all primes. A valid counterexample is conclusive against an “all” statement; ordinary examples are not by themselves a proof of it.

Worked proof: the sum of three consecutive integers is divisible by 3

Let the first integer be n, where n can be any integer. The next two consecutive integers are n + 1 and n + 2. Their sum is n + (n + 1) + (n + 2) = 3n + 3 = 3(n + 1). Since n + 1 is an integer, the sum is a multiple of 3. Therefore the sum of any three consecutive integers is divisible by 3. You can check with 4 + 5 + 6 = 15, but the proof works even for negative integers because it never depended on choosing a special n.

Worked proof: two consecutive integers have an even product

Let n and n + 1 be consecutive integers. Exactly one of them is even and the other is odd. If n is even, n(n + 1) is an even number multiplied by an integer, so the product is even. If n is odd, n + 1 is even, so the product is still even. These two cases cover every integer n. Hence n(n + 1) is even for every integer n. You can also see why this is reasonable by testing 4 × 5 = 20 and 5 × 6 = 30, but the cases provide the general proof.

Worked proof: the square of an odd integer is odd

Every odd integer has the form 2k + 1, where k is an integer. Square it: (2k + 1)² = 4k² + 4k + 1. Factor the first two terms: 2(2k² + 2k) + 1. Because 2k² + 2k is an integer, the square is two times an integer plus one, which is the definition of odd. Therefore the square of every odd integer is odd. The reasoning is general because k was never restricted to a particular value.

A proof is different from a calculation

If a question asks for 7², you calculate 49. If it asks you to prove every odd square is odd, calculating 3², 5² and 7² is not enough, even though the results are correct. The proof must describe any odd integer, such as 2k + 1, and explain why its square has the required form. This distinction is why a solution that looks numerically correct may not meet a “show that” or “prove that” instruction.

How to construct a direct proof

Copy the claim in your own words and identify the exact condition.
Introduce a symbol for a general object satisfying the condition.
Write the relevant definition, formula or accepted theorem.
Apply algebra or logical rules carefully.
Rearrange the result into the form required by the conclusion.
Finish with a sentence that connects the result to the original claim.

Proof by cases: when the problem has different possibilities

Some statements naturally divide into cases. An integer is either even or odd. To prove that n² + n is even, you can consider the case where n is even and the case where n is odd. In either case, n(n + 1) has an even factor. Because there are no other parity cases for an integer, your proof covers all possibilities. A proof by cases is complete only when every permitted case has been considered; checking just one convenient case is not enough.

A counterexample needs to satisfy the conditions

Consider the claim “the sum of any two odd integers is odd.” Choose 1 and 3. Both satisfy the condition of being odd, but their sum is 4, which is even. Therefore the claim is false. A good counterexample must obey the stated assumptions while breaking the conclusion. Choosing an even number when the question specifies an odd number would not be a valid counterexample, because it would lie outside the permitted cases.

Logical converses are not automatically true

The statement “if an integer is divisible by 4, then it is even” is true. Its converse is “if an integer is even, then it is divisible by 4”, which is false. The integer 6 is even but not divisible by 4. Reversing the order of a logical implication can change its truth. This matters in geometry too: being able to prove “if P then Q” does not automatically prove “if Q then P”. Read both directions explicitly before using a theorem.

Proof by contradiction: the basic idea

A proof by contradiction temporarily assumes the opposite of what you want to establish, then shows that this assumption leads to an impossibility. For a simple example, suppose an integer n were both even and odd. Then n = 2a and n = 2b + 1 for integers a and b. Equating gives 2a = 2b + 1, so 2(a − b) = 1. The left side is even but the right side is odd, which is impossible. Therefore no integer is simultaneously even and odd. The contradiction arose from the assumption.

Worked proof: consecutive square numbers differ by an odd number

Let n be any integer. Consecutive squares are n² and (n + 1)². Their difference is (n + 1)² − n². Expand the bracket: n² + 2n + 1 − n² = 2n + 1. Since n is an integer, 2n + 1 is odd. Therefore the difference between these two consecutive squares is always odd. For a small check, 4² − 3² = 16 − 9 = 7, but the algebra establishes the result generally.

A geometric proof needs a stated reason

In geometry, a proof should name the fact used at each step. Suppose the question gives a triangle with two interior angles 50° and 60°, then asks you to justify its third angle. The calculation is 180° − 50° − 60° = 70°. The reason is that the three interior angles of a triangle total 180°. If a longer diagram uses parallel lines, vertically opposite angles or a cyclic quadrilateral, state those relationships explicitly. Good geometry proof writing separates what is given, what is deduced and why.

What is an algebraic identity?

An identity is an equality that holds for every permitted value of its variables. For example, (x + 2)² = x² + 4x + 4 holds for every real x. Expand the left side: (x + 2)(x + 2) = x² + 2x + 2x + 4 = x² + 4x + 4. This proves the identity using the distributive law. In contrast, the equation x² = 9 holds only for x = 3 or x = −3. The difference between an identity and an equation with particular solutions is important.

Avoid invalid operations in a proof

Be careful before dividing by a variable. If you know ax = bx, you can divide by x only when x ≠ 0. Otherwise the division may be invalid. For example, the equality 0 × 3 = 0 × 5 is true, but dividing both sides by zero to claim 3 = 5 is not allowed. Many false algebra “proofs” hide division by zero or take square roots without considering signs. State conditions, preserve domains and check that every operation is reversible when you need an equivalence.

What makes a proof clear and complete?

Precise claim: tell the reader what you are proving.
Correct assumptions: introduce only facts the problem permits.
General variables: use n or k to represent any permitted integer.
Justified steps: do not skip the reason for a critical transformation.
Complete cases: if you divide into possibilities, include them all.
No circular reasoning: do not assume the conclusion you are trying to prove.
Final conclusion: return to the exact wording of the claim.

Common proof mistakes

Using a few examples as a universal proof: construct a general argument instead.
Choosing a counterexample outside the conditions: it must satisfy every assumption.
Writing “obvious” instead of explaining why: name the relevant rule.
Forgetting negative or zero cases: check the full specified domain.
Dividing by a possibly zero expression: justify that the divisor is non-zero first.
Assuming the converse is true: test each implication separately.
Proving something nearby but not the requested statement: match your final sentence to the claim.

Mini-test: classify, prove or disprove

Is the claim “every prime number is odd” true or false? Give a reason.
Prove that the sum of two even integers is even.
Prove that the sum of three consecutive integers is divisible by 3.
Is the converse of “divisible by 4 implies even” always true?
Prove that (n + 1)² − n² is odd for every integer n.

Answers with the essential arguments

1. False: the prime 2 is even. 2. Let the integers be 2a and 2b; their sum 2(a + b) is twice an integer, hence even. 3. n + (n + 1) + (n + 2) = 3(n + 1), a multiple of 3. 4. No: 6 is even but not divisible by 4. 5. (n + 1)² − n² = 2n + 1, which has the required odd form. The algebra and definitions show why each true claim holds for all permitted integers.

Your ten-minute proof-learning routine

Minutes 1–2: read a claim and underline “all”, “if”, “only”, “even” or other conditions.
Minutes 3–5: write a short direct proof using the definitions of even and odd.
Minutes 6–7: find a valid counterexample to a false universal claim.
Minute 8: distinguish a statement from its converse.
Minutes 9–10: reread every step of your proof and check that the conclusion follows from the stated assumptions.

A mathematical proof is a clear explanation of why a result must be true, not a longer version of an answer. Start with a definition, make each step valid and finish by reconnecting your reasoning to the claim. That habit will improve algebra, geometry and unfamiliar problem-solving questions.

Continue with connected Mathematics Quick Notes

Use these lessons for the next step: Algebra · Algebraic Expansion and Factorisation · Angles · Mathematics. Test yourself on a changed question and check the result before consulting worked answers.

Read the broader teaching approach in Secondary 1 Mathematics Tutor Clementi | Small Groups Tutorials. The original reference remains unchanged.

How to Learn Mathematical Proofs Quickly and Correctly | Quick Notes