Back to the full dot-point answer
NSWMaths Extension 1Quick questions
Proof (ME-P1)
Quick questions on Mathematical induction for divisibility: standard technique and algebraic restructuring
13short Q&A pairs drawn directly from our worked dot-point answer. For full context and worked exam questions, read the parent dot-point page.
What is the structure?Show answer
To prove is divisible by for all positive integers :
What is the standard algebraic move?Show answer
For , the most common technique is:
What is example pattern?Show answer
For divisible by (for any integer ): the standard manipulation is
What is different starting integer?Show answer
If the statement is "for all " or "for all ", start the base case at the smallest valid and adjust accordingly. The induction step still goes from to .
What is divisible by ?Show answer
Base (): , divisible by .
What is divisible by ?Show answer
Base (): , divisible by .
What is divisible by ?Show answer
Base (): , divisible by .
What is divisible by ?Show answer
Base (): , divisible by .
What is divisible by a non-prime?Show answer
Show divisible by for all positive integers .
What is assuming what you want to prove?Show answer
Do not write "assume " as part of the step. The step derives this from the hypothesis on .
What is confusing the hypothesis with the conclusion?Show answer
The hypothesis is about . The step derives the result at .
What is missing the base case?Show answer
Without a base case, the chain is unsupported.
What is algebra errors when expanding?Show answer
, not . Get the binomial expansion right. :::