SmarterEd

Aussie Maths & Science Teachers: Save your time with SmarterEd

  • Login
  • Get Help
  • About

Proof, EXT1 EQ-Bank 20

Use mathematical induction to prove that  \(3^n+7^n\)  is divisible by 10 for all odd \(n\).   (3 marks)

--- 10 WORK AREA LINES (style=lined) ---

Show Answers Only

\(\text{Proof (See Worked Solutions)}\)

Show Worked Solution

\(\text{Prove \(3^n+7^n\) is divisible by 10 for \(n\) odd.}\)

\(\text{Prove true for}\ \ n=1:\)

\(3^1+7^1=10 \ \ \text {(which is divisible by 10)}\)

\(\therefore \ \text{True for} \ \ n=1\)
 

\(\text{Assume true for} \ \ n=k\) :

\(3^k+7^k=10 P \ \text{(where \(P\) is an integer)}\)

\(\Rightarrow 3^k=10 P-7^k\ \ldots\ (1)\)
 

\(\text{Prove true for}\ \ n=k+2:\)

\(3^{k+2}+7^{k+2}\) \(=9 \times 3^k+49 \times 7^k\)
  \(=9\left(10 P-7^k\right)+49 \times 7^k\)
  \(=90 P-9 \times 7^k+49 \times 7^k\)
  \(=90P+40 \times 7^k\)
  \(=10\left(9 P + 4 \times 7^k\right)\)

 

\(\Rightarrow \ \text{True for} \ \ n=k+2\)

\(\therefore \ \text{Since true for \(n=1\), by PMI, true for integers \(n\) odd}.\)

Filed Under: Induction (Y12) Tagged With: Band 4, smc-7281-10-Divisibility, smc-7281-60-Proofs where \(\ n \ngeqslant 1\)

Copyright © 2014–2026 SmarterEd.com.au · Log in