10 quesitons together
Step 1 (Base Case): For \(n = 1\), the left-hand side is \(1\) and the right-hand side is \(1^2 = 1\), so the statement holds.
Step 2 (Inductive Hypothesis): Assume for some \(k \ge 1\) that
\(1 + 3 + 5 + \dots + (2k – 1) = k^2\).
Step 3 (Inductive Step): Then for \(n = k+1\),
\[
1 + 3 + \dots + (2k-1) + \bigl(2(k+1)-1\bigr)
= k^2 + (2k + 1)
= (k+1)^2.
\]
So the statement holds for \(k+1\).
Final: By induction, for all \(n \ge 1\),
\(\boxed{1 + 3 + 5 + \dots + (2n – 1) = n^2}\)
Lesson: Solving Equations and Simplifying Expressions
Lesson Notes:
- Understand how to solve linear equations
- Practice factorisation techniques
- Work with inequalities, standard form, and radicals
Use the space below to try each question and check the answers when you’re ready.
Question 1 (GDC required)
Prove that for all integers $n \geq 1$, the expression $5^n – 1$ is divisible by 4. That is, show that $4 \mid (5^n – 1)$ for all $n \in \mathbb{N}$.
Question 2 (GDC Not required)
Question 1 (Not required)
Prove by principle of mathematical induction that
\(1 + 3 + 5 + \dots + (2n – 1) = n^2\).
Question 3 (GDC Not required)
Qn
Question 4 (GDC Not required)
Qn
Question 5 (GDC Not required)
Qn
Question 6 (GDC Not required)
Qn
Question 7 (GDC Not required)
Qn
Question 8 (GDC Not required)
Qn
Question 9 (GDC Not required)
Qn
Question 10 (GDC Not required)
Qn