Skip to content
Question of 64

Q.Using Binomial Theorem, prove that 9n+1−8n−89^{n+1} - 8n - 8 always leaves remainder 1 when divided by 64, whenever nn is a positive integer.

Manipur CohsemCouncil of Higher Secondary Education, Manipur (Higher Secondary 1st Year) 2022Subjective· 6mImportance★★★★★
0% · 0/64 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Expanding 9n+1=(1+8)n+19^{n+1}=(1+8)^{n+1} by the Binomial Theorem, every term from the third one onward is divisible by 6464; collecting the first two terms separately shows 9n+1−8n−99^{n+1}-8n-9 is exactly divisible by 6464, so 9n+1−8n−89^{n+1}-8n-8 leaves remainder 11.

Write 9=1+89 = 1+8, so 9n+1=(1+8)n+19^{n+1} = (1+8)^{n+1}. By the Binomial Theorem:

(1+8)n+1=∑r=0n+1(n+1r)8r=(n+10)+(n+11)8+(n+12)82+(n+13)83+⋯+8n+1(1+8)^{n+1} = \displaystyle\sum_{r=0}^{n+1}\binom{n+1}{r}8^r = \binom{n+1}{0} + \binom{n+1}{1}8 + \binom{n+1}{2}8^2 + \binom{n+1}{3}8^3+\cdots+8^{n+1}

=1+8(n+1)+82[(n+12)+(n+13)8+⋯+8n−1]= 1 + 8(n+1) + 8^2\left[\binom{n+1}{2}+\binom{n+1}{3}8+\cdots+8^{n-1}\right]

Every term from the third onward carries a factor of 82=648^2=64, so group them as 64k64k for some non-negative integer kk (the bracketed sum is always a non-negative integer):

9n+1=1+8(n+1)+64k=1+8n+8+64k=8n+9+64k9^{n+1} = 1+8(n+1)+64k = 1+8n+8+64k = 8n+9+64k

Rearranging:

9n+1−8n−9=64k9^{n+1}-8n-9 = 64k

…

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.