Show that $9^{n+1}-8n-9$ is divisible by $64$ whenever $n$ is a positive integer.

Vedclass pdf generator app on play store
Vedclass iOS app on app store
To show that $9^{n+1}-8n-9$ is divisible by $64$,we need to prove that $9^{n+1}-8n-9 = 64k$,where $k$ is a natural number.
By the Binomial Theorem:
$(1+a)^{m} = \sum_{r=0}^{m} {^{m}C_{r}} a^{r} = {^{m}C_{0}} + {^{m}C_{1}}a + {^{m}C_{2}}a^{2} + \dots + {^{m}C_{m}}a^{m}$
For $a=8$ and $m=n+1$,we obtain:
$(1+8)^{n+1} = {^{n+1}C_{0}} + {^{n+1}C_{1}}(8) + {^{n+1}C_{2}}(8^{2}) + \dots + {^{n+1}C_{n+1}}(8^{n+1})$
$9^{n+1} = 1 + (n+1)(8) + 64 \left[ {^{n+1}C_{2}} + {^{n+1}C_{3}}(8) + \dots + {^{n+1}C_{n+1}}(8^{n-1}) \right]$
$9^{n+1} = 1 + 8n + 8 + 64 \left[ {^{n+1}C_{2}} + {^{n+1}C_{3}}(8) + \dots + {^{n+1}C_{n+1}}(8^{n-1}) \right]$
$9^{n+1} = 9 + 8n + 64 \left[ {^{n+1}C_{2}} + {^{n+1}C_{3}}(8) + \dots + {^{n+1}C_{n+1}}(8^{n-1}) \right]$
$9^{n+1} - 8n - 9 = 64k$,where $k = {^{n+1}C_{2}} + {^{n+1}C_{3}}(8) + \dots + {^{n+1}C_{n+1}}(8^{n-1})$ is a natural number.
Thus,$9^{n+1}-8n-9$ is divisible by $64$ for all positive integers $n$.

Explore More

Similar Questions

The remainder when $5^{99}$ is divided by $13$ is

The remainder when $7^n - 6n - 50$ $(n \in N)$ is divided by $36$ is:

Using the binomial theorem,prove that $6^{n} - 5n$ always leaves a remainder of $1$ when divided by $25$ for all $n \in N$.

If $a, b$ and $n$ are natural numbers, then $a^{2n-1} + b^{2n-1}$ is always divisible by:

If $n > 1$ is an integer and $x \neq 0$, then $(1+x)^{n}-nx-1$ is divisible by

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo