Using binomial theorem, prove that \(6^n-5n\) always leaves remainder \(1\) when divided by \(25.\)
CBSE Class 11 Maths · Binomial Theorem
CBSE Class 11 Maths · Binomial Theorem
Imagine you have a magic number, 6, and you secretly think of it as one more than 5. When you multiply 6 by itself many times, you are really multiplying "one more than 5" over and over. After expanding this, almost every piece is a multiple of 25, except a leftover 1. Subtracting 5 times your count removes one tidy chunk. What remains is always exactly 1 more than some multiple of 25, like a cookie always left on the plate.
Answer: Since \( 6^n - 5n = 1 + 25k \) for some whole number \( k \), the expression \( 6^n - 5n \) always leaves remainder \( 1 \) when divided by \( 25 \), which is what we wanted to prove.
The key idea is to write \( 6 \) as \( 1 + 5 \), so that \( 6^n = (1 + 5)^n \). When we expand \( (1 + 5)^n \) using the binomial theorem, the powers of \( 5 \) appear. The first two terms give us \( 1 \) and \( 5n \), and every remaining term contains \( 5^2 = 25 \) or a higher power of \( 5 \) as a factor. This means all those remaining terms are exactly divisible by \( 25 \). By subtracting \( 5n \), we cancel the second term, and we are left with \( 1 \) plus a multiple of \( 25 \). That is precisely what it means for the remainder to be \( 1 \) upon division by \( 25 \).
\[(a + b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^{r}\]
Since \( 6^n - 5n = 1 + 25k \) for some whole number \( k \), the expression \( 6^n - 5n \) always leaves remainder \( 1 \) when divided by \( 25 \), which is what we wanted to prove.
A common mistake is writing \( 6 = 5 + 1 \) but forgetting that the term \( \binom{n}{2} 5^2 \) already carries \( 25 \); students sometimes only cancel one term or fail to check that ALL remaining terms have \( 5^2 \) or higher, wrongly concluding the remainder involves \( 5n \).
Since \( 6^n - 5n = 1 + 25k \) for some whole number \( k \), the expression \( 6^n - 5n \) always leaves remainder \( 1 \) when divided by \( 25 \), which is what we wanted to prove.
One common mistake: Students forget to subtract \( 5n \) after expanding \( (1+5)^n \), and instead try to show that \( 6^n \) alone is divisible by 25, which is incorrect — it is the combined expression \( 6^n - 5n \) that has remainder 1, not \( 6^n \) by itself.
Answer: Since \( 6^n - 5n = 1 + 25k \) for some whole number \( k \), the expression \( 6^n - 5n \) always leaves remainder \( 1 \) when divided by \( 25 \), which is what we wanted to prove.
Question: Using the Binomial Theorem, prove that \( 7^n - 6n \) always leaves remainder \( 1 \) when divided by \( 36 \).
Solution: We want to show that \( 7^n - 6n - 1 \) is divisible by \( 36 \) for every positive integer \( n \). Write \( 7 = 1 + 6 \), so \[7^n = (1 + 6)^n\] Expanding by the Binomial Theorem: \[7^n = \sum_{r=0}^{n} \binom{n}{r} 1^{n-r} \cdot 6^r = \binom{n}{0} + \binom{n}{1} \cdot 6 + \binom{n}{2} \cdot 6^2 + \binom{n}{3} \cdot 6^3 + \cdots + 6^n\] The first two terms give: \[7^n = 1 + 6n + \binom{n}{2} \cdot 36 + \binom{n}{3} \cdot 6^3 + \cdots + 6^n\] Notice that every term from the third onward contains \( 6^2 = 36 \) as a factor. Therefore: \[7^n - 6n - 1 = \binom{n}{2} \cdot 36 + \binom{n}{3} \cdot 6^3 + \cdots + 6^n\] Factoring out \( 36 \): \[7^n - 6n - 1 = 36\left[\binom{n}{2} + \binom{n}{3} \cdot 6 + \cdots + 6^{n-2}\right]\] The expression inside the bracket is an integer for every positive integer \( n \). Hence \( 36 \mid (7^n - 6n - 1) \), which means \( 7^n - 6n \) always leaves remainder \( 1 \) when divided by \( 36 \).
Answer: \( 7^n - 6n \) always leaves remainder \( 1 \) when divided by \( 36 \). (Proved)
Question: Using the Binomial Theorem, prove that \( 4^n - 3n \) always leaves remainder \( 1 \) when divided by \( 9 \).
Solution: We want to show that \( 4^n - 3n - 1 \) is divisible by \( 9 \) for every positive integer \( n \). Write \( 4 = 1 + 3 \), so \[4^n = (1 + 3)^n\] Expanding by the Binomial Theorem: \[4^n = \sum_{r=0}^{n} \binom{n}{r} 1^{n-r} \cdot 3^r = \binom{n}{0} + \binom{n}{1} \cdot 3 + \binom{n}{2} \cdot 3^2 + \binom{n}{3} \cdot 3^3 + \cdots + 3^n\] The first two terms give: \[4^n = 1 + 3n + \binom{n}{2} \cdot 9 + \binom{n}{3} \cdot 27 + \cdots + 3^n\] Every term from the third onward contains \( 3^2 = 9 \) as a factor. Therefore: \[4^n - 3n - 1 = \binom{n}{2} \cdot 9 + \binom{n}{3} \cdot 27 + \cdots + 3^n\] Factoring out \( 9 \): \[4^n - 3n - 1 = 9\left[\binom{n}{2} + \binom{n}{3} \cdot 3 + \cdots + 3^{n-2}\right]\] The expression inside the bracket is an integer for every positive integer \( n \). Hence \( 9 \mid (4^n - 3n - 1) \), which means \( 4^n - 3n \) always leaves remainder \( 1 \) when divided by \( 9 \).
Answer: \( 4^n - 3n \) always leaves remainder \( 1 \) when divided by \( 9 \). (Proved)
Question: Using the Binomial Theorem, prove that \( 7^n - 6n \) always leaves remainder \( 1 \) when divided by \( 36 \), for all positive integers \( n \).
Answer: Since \( 7^n - 6n = 1 + 36k \) for some non-negative integer \( k \), the expression \( 7^n - 6n \) always leaves remainder \( 1 \) when divided by \( 36 \).