SOLVER7 Study. Nothing Else.
Exercise 7.1 Q13

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

CBSE Class 11 Maths · Binomial Theorem

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a big number like 9, and you secretly write it as 1 plus 8. When you multiply 9 by itself many times, you are really multiplying (1 plus 8) many times. Most of the pieces you get will contain 8 times 8, which equals 64. The leftover tiny pieces cancel out with the other parts of the problem. So the whole expression is always a neat multiple of 64, no matter which positive whole number you pick for n.

Answer: Since \( 9^{n+1} - 8n - 9 = 64k \) where \( k \) is an integer, the expression is divisible by 64 for every positive integer \( n \). Hence proved.

📖 Divisibility of 9^(n+1) - 8n - 9 by 64 using Binomial Theorem

Detailed Explanation

To show that an expression is divisible by a number like 64, we try to rewrite it so that a factor of 64 (or its equivalent) comes out clearly. Here 64 is \( 8^2 \), so a good idea is to write the base 9 as \( 1 + 8 \) and expand using the Binomial Theorem. When we expand \( (1 + 8)^{n+1} \), the terms containing \( 8^0 \) and \( 8^1 \) get cancelled by the \( -8n - 9 \) part, and every remaining term contains \( 8^2 = 64 \) as a factor. This makes the divisibility obvious. The Binomial Theorem states that for a positive integer power \( m \), the expression \( (a + b)^m \) can be written as a sum of terms involving binomial coefficients.

Formula Used

\[(1 + x)^{m} = \sum_{r=0}^{m} \binom{m}{r} x^{r} = 1 + \binom{m}{1}x + \binom{m}{2}x^{2} + \cdots + \binom{m}{m}x^{m}\]

Solution

  1. Step 1: Rewrite the base 9 in a way that brings out 8, since \( 64 = 8^2 \). We use \( 9 = 1 + 8 \). So the term \( 9^{n+1} \) becomes \( (1 + 8)^{n+1} \).
  2. Step 2: Expand \( (1 + 8)^{n+1} \) using the Binomial Theorem with \( x = 8 \) and power \( m = n+1 \): \[(1 + 8)^{n+1} = \binom{n+1}{0} + \binom{n+1}{1} 8 + \binom{n+1}{2} 8^{2} + \binom{n+1}{3} 8^{3} + \cdots + \binom{n+1}{n+1} 8^{n+1}\]
  3. Step 3: Simplify the first two terms. Since \( \binom{n+1}{0} = 1 \) and \( \binom{n+1}{1} = n+1 \), we get \[9^{n+1} = 1 + 8(n+1) + \binom{n+1}{2} 8^{2} + \binom{n+1}{3} 8^{3} + \cdots\] which is \[9^{n+1} = 1 + 8n + 8 + 8^{2}\left[\binom{n+1}{2} + \binom{n+1}{3} 8 + \cdots \right]\]
  4. Step 4: Now substitute this into the original expression \( 9^{n+1} - 8n - 9 \): \[9^{n+1} - 8n - 9 = \left(1 + 8n + 8 + 8^{2}\,k\right) - 8n - 9\] where \[k = \binom{n+1}{2} + \binom{n+1}{3} 8 + \cdots + \binom{n+1}{n+1} 8^{n-1}\] Note that \( k \) is a whole number because it is a sum of products of binomial coefficients and powers of 8.
  5. Step 5: Cancel the constant and linear terms. The \( +8n \) cancels \( -8n \), and \( 1 + 8 - 9 = 0 \). This leaves \[9^{n+1} - 8n - 9 = 8^{2}\,k = 64\,k\]
  6. Step 6: Since \( k \) is a positive integer (a whole number) for every positive integer \( n \), the expression equals \( 64 \) times an integer. Therefore \( 9^{n+1} - 8n - 9 \) is divisible by 64 for every positive integer \( n \).

Final Answer

Since \( 9^{n+1} - 8n - 9 = 64k \) where \( k \) is an integer, the expression is divisible by 64 for every positive integer \( n \). Hence proved.

Common Mistake

A common mistake is to write \( 9 = 8 + 1 \) but then forget that only the \( 8^{2} \) and higher power terms give the factor of 64 — students sometimes wrongly claim the first two terms are also divisible by 64. The correct approach is to let the \( -8n - 9 \) exactly cancel the first two terms of the expansion, so that only the \( 8^2 = 64 \) factor remains.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Notice that \( 64 = 8^2 \). To bring out a factor of \( 8^2 \), write the base 9 as \( 1 + 8 \), so that \( 9^{n+1} = (1+8)^{n+1} \). — Reason: Splitting 9 into \( 1 + 8 \) lets the Binomial Theorem produce powers of 8, making the factor \( 8^2 \) visible.
  2. Step 2: Apply the Binomial Theorem to \( (1+8)^{n+1} \): \[(1+8)^{n+1} = \binom{n+1}{0} + \binom{n+1}{1}\cdot 8 + \binom{n+1}{2}\cdot 8^{2} + \binom{n+1}{3}\cdot 8^{3} + \cdots + \binom{n+1}{n+1}\cdot 8^{n+1}\] — Reason: The Binomial Theorem gives an exact expansion whose individual terms can be examined for common factors.
  3. Step 3: Evaluate the first two terms using \( \binom{n+1}{0} = 1 \) and \( \binom{n+1}{1} = n+1 \): \[9^{n+1} = 1 + (n+1)\cdot 8 + \binom{n+1}{2}\cdot 8^{2} + \binom{n+1}{3}\cdot 8^{3} + \cdots\] which can be rewritten as \[9^{n+1} = 1 + 8n + 8 + 8^{2}\left[\binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots + 8^{n-1}\right]\] — Reason: Separating the constant and linear terms prepares us to cancel them with the \( -8n - 9 \) part of the expression.
  4. Step 4: Subtract \( 8n + 9 \) from both sides. Starting from \[9^{n+1} = 9 + 8n + 64\left[\binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots\right]\] subtract \( 8n + 9 \) to get \[9^{n+1} - 8n - 9 = 64\left[\binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots + 8^{n-1}\right]\] — Reason: The terms 1 and 8 combine to give 9, which cancels with \( -9 \), and \( 8n \) cancels with \( -8n \), leaving only multiples of 64.
  5. Step 5: Let \( k = \binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots + 8^{n-1} \). Since \( n \) is a positive integer, every binomial coefficient \( \binom{n+1}{r} \) is an integer, so \( k \) is a non-negative integer. Therefore \[9^{n+1} - 8n - 9 = 64k\] — Reason: Naming the bracketed sum \( k \) lets us state the result cleanly and confirms that the expression is an integer multiple of 64.

Final Answer

Since \( 9^{n+1} - 8n - 9 = 64k \) where \( k \) is an integer, the expression is divisible by 64 for every positive integer \( n \). Hence proved.

Common Mistake

One common mistake: forgetting that \( 1 + 8 = 9 \) (not just 8), so the constant term from the expansion is 1 and the linear term gives \( 8(n+1) = 8n + 8 \); together they produce \( 8n + 9 \), which must cancel with \( -8n - 9 \). Students who treat the linear term as simply \( 8n \) lose the 8 that combines with 1 to make 9, and the cancellation fails.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Write \( 9^{n+1} = (1+8)^{n+1} \) and expand using the Binomial Theorem: \[ (1+8)^{n+1} = \binom{n+1}{0} + \binom{n+1}{1}8 + \binom{n+1}{2}8^{2} + \binom{n+1}{3}8^{3} + \cdots + \binom{n+1}{n+1}8^{n+1} \]
  2. Step 2: Since \( \binom{n+1}{0} = 1 \) and \( \binom{n+1}{1} \cdot 8 = 8(n+1) = 8n+8 \), rewrite as: \[ 9^{n+1} = 1 + 8n + 8 + 8^{2}\left[\binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots + 8^{n-1}\right] \]
  3. Step 3: Subtract \( 8n + 9 \) from both sides: \[ 9^{n+1} - 8n - 9 = 8^{2}\left[\binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots + 8^{n-1}\right] = 64k \] where \( k = \binom{n+1}{2} + \binom{n+1}{3}\cdot 8 + \cdots + 8^{n-1} \) is a positive integer.

Answer: Since \( 9^{n+1} - 8n - 9 = 64k \) where \( k \) is an integer, the expression is divisible by 64 for every positive integer \( n \). Hence proved.

➕ More Examples

More Examples

Example 1

Question: Show that \( 25^{n+1} - 24n - 25 \) is divisible by \( 576 \) for every positive integer \( n \).

Solution: We use the Principle of Mathematical Induction. Note that \( 576 = 24^2 \). Let \( P(n) \) denote the statement: \( 25^{n+1} - 24n - 25 \) is divisible by \( 576 \). Step 1 — Base case (\( n = 1 \)): When \( n = 1 \), \[25^{2} - 24(1) - 25 = 625 - 24 - 25 = 576.\] Since \( 576 = 576 \times 1 \), the expression is divisible by \( 576 \). So \( P(1) \) is true. Step 2 — Inductive hypothesis: Assume \( P(k) \) is true for some positive integer \( k \), i.e., assume \( 25^{k+1} - 24k - 25 = 576m \) for some integer \( m \). That is, \[25^{k+1} = 576m + 24k + 25.\] Step 3 — Inductive step (show \( P(k+1) \) is true): We need to show \( 25^{k+2} - 24(k+1) - 25 \) is divisible by \( 576 \). Express \( 25^{k+2} \) as \[25^{k+2} = 25 \times 25^{k+1}.\] Substituting the inductive hypothesis, \[25^{k+2} = 25\left(576m + 24k + 25\right).\] Expanding, \[25^{k+2} = 25 \times 576m + 25 \times 24k + 25^2.\] Now compute \( 25^{k+2} - 24(k+1) - 25 \): \[25^{k+2} - 24(k+1) - 25 = 25 \times 576m + 600k + 625 - 24k - 24 - 25.\] Simplifying, \[= 25 \times 576m + 576k + 576.\] Factoring, \[= 576\left(25m + k + 1\right).\] Since \( 25m + k + 1 \) is an integer, the expression \( 25^{k+2} - 24(k+1) - 25 \) is divisible by \( 576 \). So \( P(k+1) \) is true. Conclusion: By the Principle of Mathematical Induction, \( 25^{n+1} - 24n - 25 \) is divisible by \( 576 \) for every positive integer \( n \).

Answer: \( 25^{n+1} - 24n - 25 \) is divisible by \( 576 \) for all positive integers \( n \).

Example 2

Question: Prove by the Principle of Mathematical Induction that \( 7^{n+2} + 8^{2n+1} \) is divisible by \( 57 \) for every positive integer \( n \).

Solution: Let \( P(n) \) denote the statement: \( 7^{n+2} + 8^{2n+1} \) is divisible by \( 57 \). Step 1 — Base case (\( n = 1 \)): When \( n = 1 \), \[7^{3} + 8^{3} = 343 + 512 = 855.\] Dividing, \( 855 \div 57 = 15 \), so the expression equals \( 57 \times 15 \). Thus \( P(1) \) is true. Step 2 — Inductive hypothesis: Assume \( P(k) \) is true for some positive integer \( k \), i.e., assume \[7^{k+2} + 8^{2k+1} = 57\lambda\] for some integer \( \lambda \). That is, \[7^{k+2} = 57\lambda - 8^{2k+1}.\] Step 3 — Inductive step (show \( P(k+1) \) is true): We need to show \( 7^{k+3} + 8^{2k+3} \) is divisible by \( 57 \). Write \[7^{k+3} + 8^{2k+3} = 7 \times 7^{k+2} + 8^2 \times 8^{2k+1}.\] Substituting \( 7^{k+2} = 57\lambda - 8^{2k+1} \), \[7^{k+3} + 8^{2k+3} = 7\left(57\lambda - 8^{2k+1}\right) + 64 \times 8^{2k+1}.\] Expanding, \[= 7 \times 57\lambda - 7 \times 8^{2k+1} + 64 \times 8^{2k+1}.\] Collecting the terms with \( 8^{2k+1} \), \[= 7 \times 57\lambda + (64 - 7) \times 8^{2k+1}.\] Simplifying, \[= 7 \times 57\lambda + 57 \times 8^{2k+1}.\] Factoring, \[= 57\left(7\lambda + 8^{2k+1}\right).\] Since \( 7\lambda + 8^{2k+1} \) is an integer, the expression \( 7^{k+3} + 8^{2k+3} \) is divisible by \( 57 \). So \( P(k+1) \) is true. Conclusion: By the Principle of Mathematical Induction, \( 7^{n+2} + 8^{2n+1} \) is divisible by \( 57 \) for every positive integer \( n \).

Answer: \( 7^{n+2} + 8^{2n+1} \) is divisible by \( 57 \) for all positive integers \( n \).

🎯 Try a Similar Question

Try a Similar Question

Question: Using the Binomial Theorem, show that \( 8^{n+1} - 7n - 8 \) is divisible by 49 for every positive integer \( n \).

Solution

  1. Step 1: Rewrite the base using Binomial form: We write \( 8 = 1 + 7 \), so \( 8^{n+1} = (1 + 7)^{n+1} \). Now expand using the Binomial Theorem: \[(1 + 7)^{n+1} = \sum_{r=0}^{n+1} \binom{n+1}{r} 7^r\]
  2. Step 2: Write out the first few terms explicitly: Expanding the sum: \[8^{n+1} = \binom{n+1}{0} 7^0 + \binom{n+1}{1} 7^1 + \binom{n+1}{2} 7^2 + \binom{n+1}{3} 7^3 + \cdots + \binom{n+1}{n+1} 7^{n+1}\] This gives: \[8^{n+1} = 1 + (n+1) \cdot 7 + \binom{n+1}{2} 7^2 + \binom{n+1}{3} 7^3 + \cdots + 7^{n+1}\]
  3. Step 3: Simplify the expansion: We get: \[8^{n+1} = 1 + 7n + 7 + 7^2 \left[ \binom{n+1}{2} + \binom{n+1}{3} \cdot 7 + \cdots + 7^{n-1} \right]\] That is: \[8^{n+1} = 7n + 8 + 49 \left[ \binom{n+1}{2} + \binom{n+1}{3} \cdot 7 + \cdots + 7^{n-1} \right]\]
  4. Step 4: Rearrange to isolate the target expression: Subtracting \( 7n + 8 \) from both sides: \[8^{n+1} - 7n - 8 = 49 \left[ \binom{n+1}{2} + \binom{n+1}{3} \cdot 7 + \cdots + 7^{n-1} \right]\]
  5. Step 5: Conclude divisibility: Let \( k = \binom{n+1}{2} + \binom{n+1}{3} \cdot 7 + \cdots + 7^{n-1} \). Since each \( \binom{n+1}{r} \) is a positive integer and each power of 7 is a positive integer, \( k \) is a positive integer for every positive integer \( n \). Therefore: \[8^{n+1} - 7n - 8 = 49k\] which shows that \( 8^{n+1} - 7n - 8 \) is divisible by 49 for every positive integer \( n \). Hence proved.

Answer: Since \( 8^{n+1} - 7n - 8 = 49k \) where \( k \) is a positive integer, the expression \( 8^{n+1} - 7n - 8 \) is divisible by 49 for every positive integer \( n \). Hence proved.

Everything you get with Solver7

More questions in Binomial Theorem