QCEVault

Proof by mathematical induction — Question 2

QCAA 2020, Paper 1 · 1 mark

Q2 · 2020 · Technology-freeSimple familiar1 mark

QUESTION 2

When using proof by mathematical induction to show that n(2n−1)(2n+1)n(2n-1)(2n+1) is divisible by 33 ∀ n∈Z+\forall\,n\in\mathbb{Z}^+, the inductive step requires proving
(A)
(k+1)(2k)(2k+2)(k+1)(2k)(2k+2) is divisible by 33.
(B)
(k+1)(2k)(2k+3)(k+1)(2k)(2k+3) is divisible by 33.
(C)
(k+1)(2k+1)(2k+2)(k+1)(2k+1)(2k+2) is divisible by 33.
(D)
(k+1)(2k+1)(2k+3)(k+1)(2k+1)(2k+3) is divisible by 33.
Question linkOriginal paper

Related questions

  1. Q5 · 2025 QCAA · Paper 1 · 1 mark
    Within the method of proof using mathematical induction, for which sum is the initial statement true?
    Proof by mathematical induction
  2. Q4 · 2025 QCAA · Paper 2 · 1 mark
    The expression 9×2n+1+2n9\times 2^{n+1}+2^n, where n∈Z+n\in\mathbb Z^+, is divisible by
    Proof by mathematical induction
  3. Q15 · 2025 QCAA · Paper 2 · 6 marks
    De Moivre’s theorem can be expressed as (r(cos⁡θ+isin⁡θ))n=rn(cos⁡(nθ)+isin⁡(nθ))∀n∈Z+.\bigl(r(\cos\theta+i\sin\theta)\bigr)^n=r^n\bigl(\cos(n\theta)+i\sin(n\theta)\bigr)\qquad\forall n\in\mathbb Z^+. Prove De Moivre’s theorem using mathematical induction.
    Proof by mathematical induction
  4. Q3 · 2024 QCAA · Paper 1 · 1 mark
    Consider a proof of the proposition ∑j=1n(2j−1)=n2 ∀n∈Z+\displaystyle\sum_{j=1}^{n}(2j-1)=n^2\ \forall n\in\mathbb Z^+ using mathematical induction. Within the proof of the inductive step, the proposition for n=k+1n=k+1 could be expressed as
    Proof by mathematical induction