Expert Answers

An illustration of the letter 'A' in a speech bubbles

You need to perform mathematical induction to test if the given statement holds for all `n>=1` , hence, you need to start by showing that the statement holds for `n = 1` , such that:

`64|(3^(2+2) - 8 - 9) => 64|(81 - 17) => 64|64`

Since the basis step proves that the statement `P(n)` holds for `n = 1` , you need to perform the second step, called inductive step. You need to prove that if `P(k)` holds, then `P(k+1)` holds, such that:

`P(k): 64|(3^(2k+2) - 8k - 9)` holds

`P(k): 64|(9^(k+1) - 8k - 9) => P(k): 64|(9(9^k - 1) - 8k)`

`For k =1 => P(1): 64|(9*8 - 8k) => P(1): 64|8*(9 - k)`

You need to prove that `P(k+1)` also holds, such that:

`P(k+1): 64|(3^(2(k+1)+2) - 8(k+1) - 9)`

`P(k+1): 64|(9^(k+2) - 8(k+1) - 9)`

`P(k+1): 64|(9*9^(k+1) - 8k - 8 - 9)`

`P(k+1): 64|(9*(9^(k+1) - 1) - 8k - 8)`

`P(k+1): 64|(9*(9^(k+1) - 1) - 8(k+1))` holds

Hence, since the two steps of mathematical induction hold, then the statement `P(n): 64|(3^(2n+2) - 8n - 9) `  holds for all `n>=1.`

`holds for all n>=1.`

Approved by eNotes Editorial Team

We’ll help your grades soar

Start your 48-hour free trial and unlock all the summaries, Q&A, and analyses you need to get better grades now.

  • 30,000+ book summaries
  • 20% study tools discount
  • Ad-free content
  • PDF downloads
  • 300,000+ answers
  • 5-star customer support
Start your 48-Hour Free Trial