Induction Divisibility Proof – Exam Method Explained

Induction Divisibility Proof – Structuring the Argument

Divisibility proofs by induction are one of those topics that feel abstract until you see how examiners actually mark them. Students often understand the idea informally — “it works for the next number, so it keeps working” — but struggle to turn that into a clean, mark-scoring argument.
Pause for a second though. Induction is not about clever algebra. It’s about structure and discipline.

Once you follow the expected layout, these questions become very predictable.

And predictability is exactly what examiners like.

This is why divisibility proofs sit right at the centre of A Level Maths practice ideas when learning to write mathematically, not just calculate.

This question builds directly on the induction framework introduced in Proof by Induction — Method & Exam Insight, particularly the structure of the inductive step.

🔙 Previous topic:

Before tackling Induction Divisibility Proof – Exam Method Explained, recall Circle Normal Equation – Normal to a Circle, where precision in method and clear justification were just as important for convincing the examiner.

📘 Exam Context

Divisibility proofs by induction appear regularly across AQA, Edexcel, and OCR papers. Sometimes the statement looks intimidating at first glance, packed with symbols and constants. In reality, the method never changes. Examiners are checking whether you can follow the induction structure precisely. Most lost marks come from missing steps, poor notation, or failing to complete the argument properly.

📦 Problem Setup

You are usually given a statement involving divisibility for all positive integers, such as showing that an expression is divisible by a fixed number for all $n\in\mathbb{N}$ . Your task is to prove this statement using mathematical induction.

🧠 Key Ideas Explained

🧮 Base case: showing it works at the start

In the base case, you substitute the starting value of $n$ into the given expression and show that the divisibility claim holds. This step is usually straightforward, but it must be written clearly. Examiners want to see the actual substitution and the conclusion stated explicitly. A vague sentence like “this works” is not enough.

🧩 Induction hypothesis: stating the assumption properly

The induction hypothesis is where many students slip up. You must clearly state what you are assuming. That usually means writing something like “assume the statement is true for $n=k$ ”, followed by the exact algebraic expression. This assumption is not optional — it is the engine that drives the proof.

Developing this habit is exactly what A Level Maths revision that sticks is designed to reinforce.

🧱 Induction step: proving it works for the next value

In the induction step, you substitute $k+1$ into the original expression. The key move is then to rearrange the expression so that part of it matches the induction hypothesis. Once that happens, divisibility usually becomes obvious.
This is not about expanding everything blindly. It is about shaping the algebra so the assumed result appears naturally.

🧠 Closing the argument properly

A correct induction proof must end with a clear conclusion. Examiners expect a sentence stating that the statement is therefore true for all natural numbers from the starting value onwards. Without this, the proof feels unfinished, even if the algebra is correct.

⚠️ Common Errors & Exam Traps

Forgetting to state the induction hypothesis explicitly
Expanding expressions instead of factorising sensibly
Using the assumption without saying it is an assumption
Stopping after the algebra without a concluding sentence

Mixing up $k$ and $k+1$ partway through

🧠 Examiner Breakdown

Question (exam-style)

Prove by induction that a given algebraic expression is divisible by a fixed integer for all $n\geq1$ .

Correct Solution (exam-standard method)

The base case is shown by substituting $n=1$ into the expression and verifying the divisibility.
Assume the statement is true for $n=k$ .
Substitute $n=k+1$ into the expression and rearrange so that the assumed result appears as a factor.
Use the induction hypothesis to complete the divisibility argument.
Conclude that the statement holds for all $n\geq1$ .

Mark Scheme Allocation (typical)

M1 – Correct base case
M1 – Clear statement of induction hypothesis
M1 – Correct induction step using the assumption
A1 – Clear concluding statement
(4 marks total)

Examiner Comment

Many candidates understand the idea of induction but lose marks through poor structure. Clear statements of assumption and conclusion are rewarded even when algebra is not perfectly neat.

Common Errors That Cost Marks

Omitting the induction hypothesis
Using the assumption without referencing it
Algebra that does not link back to the hypothesis
Missing or vague final conclusion

🌍 Real-World Link

Induction mirrors how many results are justified in computer science and algorithms, where a rule is shown to work at the start and then proven to hold as systems scale. The logical discipline behind induction is far more important than the specific algebra involved.

Author Bio – S. Mahandru

Written by an A Level Maths teacher who has marked years of induction scripts and seen how often strong algebra is undermined by weak structure. The focus here is on writing proofs that examiners can follow easily and award marks to confidently.

➰ Next Steps

If you want to build confidence with proof questions and learn how examiners actually award marks, an exam-focused A Level Maths Revision Course helps reinforce this structure across all proof topics.

📊 Recap Table

Stage	What to show
Base case	Statement works at start
Hypothesis	Clear assumption for $n=k$
Induction step	Link $k+1$ to assumption
Conclusion	Statement holds for all $n$

🧭 Next topic:

Having mastered Induction Divisibility Proof – Exam Method Explained, the same proof structure now carries directly into Induction Summation Formula – 7 Powerful Steps to Secure Full Marks, where accuracy in each induction step is even more closely scrutinised by examiners.

❓ Quick FAQs

🧭Why do examiners care so much about structure in induction proofs?

Because induction is fundamentally a logical argument, not a calculation. Examiners need to see that you understand which statements are assumptions and which are conclusions. If the structure is unclear, they cannot award method marks confidently. Even strong algebra cannot rescue a proof with missing logical steps. Writing induction clearly is about communication, not cleverness.

🧠 Do I need to write the words “assume true for n = k”?

Yes, and it matters more than students realise. That sentence tells the examiner exactly where the assumption begins. Without it, the rest of the proof can look like unsupported algebra. Examiners are trained to look for that line as a method marker. Skipping it almost always costs marks.

⚖️ What if my algebra works but I forget the final conclusion?

You will usually lose the final accuracy mark. Induction proofs are only complete when you explicitly state that the result holds for all required values of $n$ . Think of the conclusion as closing a loop. Without it, the proof is unfinished in the examiner’s eyes, even if everything else is correct.