Maths4U
Menu

Exam-Style Problem

Back to Proof by induction for divisibility
Browsing as Guest. Progress, bookmarks and attempts are disabled. Log in to track your work.
Proof by induction for divisibility — problem 2 · Maths4U Original · 8 marks
17012

Notes & worked examples

Info
Maths4U Original · M4U-EXT-9231-FP1-T419-P02

Work with the integer powers \(6^n-4^n\).

  1. Prove by induction that 2 divides \(6^n-4^n\) for all positive integers n. [4]
  2. Find the difference at \(\displaystyle n=1\). Explain your reasoning. [2]
  3. Find the quotient at \(\displaystyle n=4\). Explain your reasoning. [2]
No problems left in this filter.
Back to Proof by induction for divisibility