Show that \(9^{n+1}-8n-9\) is divisible by \(64,\) whenever \(n\) is a positive integer.
CBSE Class 11 Maths · Binomial Theorem
CBSE Class 11 Maths · Binomial Theorem
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.
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.
\[(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}\]
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.
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.
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.
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.
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.
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 \).
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 \).
Question: Using the Binomial Theorem, show that \( 8^{n+1} - 7n - 8 \) is divisible by 49 for every positive integer \( n \).
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.