QCEVault

Mathematical induction and trigonometric proofs — Question 292

Original QCE Vault practice · 1 mark

Q292 · Practice questionTechnology-freeSimple familiar1 mark

QUESTION 292

A student verifies a proposition for n=1, then proves that if it holds for n=k, it holds for n=k+2. What can this establish without another base case?
(A)
The proposition holds for every positive even integer.
(B)
The proposition has been disproved.
(C)
The proposition holds for every positive integer.
(D)
The proposition holds for every positive odd integer.
Question linkSyllabus coverage

Related questions

  1. Q178 · Original practice · 6 marks
    Consider (cos⁡θ+isin⁡θ)4(\cos\theta+i\sin\theta)^4.
    Mathematical induction and trigonometric proofs
  2. Q179 · Original practice · 6 marks
    For positive integers n, let Sn=∑k=1n(2k−1)3S_n=\sum_{k=1}^n(2k-1)^3.
    Mathematical induction and trigonometric proofs
  3. Q180 · Original practice · 6 marks
    For positive integers n, consider 8n−18^n-1.
    Mathematical induction and trigonometric proofs
  4. Q181 · Original practice · 6 marks
    A programmable light display contains k2kk2^k lights in row k, for k=1,…,nk=1,\ldots,n.
    Mathematical induction and trigonometric proofs