SOLVER7 Study. Nothing Else.
Chapter 7 Examples Q4

Using binomial theorem, prove that \(6^n-5n\) always leaves remainder \(1\) when divided by \(25.\)

CBSE Class 11 Maths · Binomial Theorem

Solution

👶 Simple Explanation

Simple Explanation

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.

📖 Proving 6^n - 5n leaves remainder 1 when divided by 25

Detailed Explanation

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 \).

Formula Used

\[(a + b)^n = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^{r}\]

Solution

  1. Step 1: Rewrite the base \( 6 \) as \( 1 + 5 \), so that we can apply the binomial theorem. This gives \[6^n = (1 + 5)^n.\]
  2. Step 2: Expand \( (1 + 5)^n \) using the binomial theorem with \( a = 1 \) and \( b = 5 \): \[(1 + 5)^n = \binom{n}{0} + \binom{n}{1} 5 + \binom{n}{2} 5^2 + \binom{n}{3} 5^3 + \cdots + \binom{n}{n} 5^n.\]
  3. Step 3: Evaluate the first two terms. Since \( \binom{n}{0} = 1 \) and \( \binom{n}{1} = n \), the first two terms are \( 1 \) and \( 5n \). So \[6^n = 1 + 5n + \binom{n}{2} 5^2 + \binom{n}{3} 5^3 + \cdots + \binom{n}{n} 5^n.\]
  4. Step 4: Subtract \( 5n \) from both sides to form the required expression. The term \( 5n \) cancels: \[6^n - 5n = 1 + \binom{n}{2} 5^2 + \binom{n}{3} 5^3 + \cdots + \binom{n}{n} 5^n.\]
  5. Step 5: Notice that every remaining term (from \( \binom{n}{2} 5^2 \) onward) contains a factor of \( 5^2 = 25 \). Factor \( 25 \) out of these terms: \[6^n - 5n = 1 + 25\left( \binom{n}{2} + \binom{n}{3} 5 + \cdots + \binom{n}{n} 5^{n-2} \right).\]
  6. Step 6: Let \( k = \binom{n}{2} + \binom{n}{3} 5 + \cdots + \binom{n}{n} 5^{n-2} \), which is a whole number. Then \[6^n - 5n = 1 + 25k.\] This shows \( 6^n - 5n \) is exactly \( 1 \) more than a multiple of \( 25 \), so it leaves remainder \( 1 \) when divided by \( 25 \).

Final 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.

Common Mistake

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 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Rewrite \( 6^n \) by expressing the base 6 as \( (1 + 5) \), giving \[6^n = (1 + 5)^n.\] Reason: Splitting 6 into \( 1 + 5 \) allows us to directly apply the Binomial Theorem and track exactly which powers of 5 appear in the expansion.
  2. Step 2: Expand \( (1 + 5)^n \) using the Binomial Theorem with \( a = 1 \) and \( b = 5 \): \[(1 + 5)^n = \binom{n}{0}(1)^n + \binom{n}{1}(1)^{n-1}(5) + \binom{n}{2}(1)^{n-2}(5)^2 + \binom{n}{3}(1)^{n-3}(5)^3 + \cdots + \binom{n}{n}(5)^n.\] Reason: The Binomial Theorem gives us every term of the expansion in an organised way, making it easy to separate terms by their power of 5.
  3. Step 3: Simplify using \( \binom{n}{0} = 1 \), \( \binom{n}{1} = n \), and \( (1)^k = 1 \) for any \( k \): \[6^n = 1 + 5n + \binom{n}{2}5^2 + \binom{n}{3}5^3 + \cdots + \binom{n}{n}5^n.\] Reason: Evaluating the first two binomial coefficients and powers of 1 explicitly lets us see the \( 5n \) term clearly, which must later be cancelled.
  4. Step 4: Subtract \( 5n \) from both sides to build the target expression \( 6^n - 5n \): \[6^n - 5n = 1 + \binom{n}{2}5^2 + \binom{n}{3}5^3 + \cdots + \binom{n}{n}5^n.\] Reason: The problem asks about \( 6^n - 5n \), so subtracting \( 5n \) eliminates the lone \( 5n \) term and leaves only the constant 1 and terms with higher powers of 5.
  5. Step 5: Observe that every term from \( \binom{n}{2}5^2 \) onward contains \( 5^2 = 25 \) as a factor. Factor out 25 from all those terms: \[6^n - 5n = 1 + 25\left[\binom{n}{2} + \binom{n}{3}5 + \cdots + \binom{n}{n}5^{n-2}\right].\] Reason: Since every remaining term has at least \( 5^2 \) as a factor, they are all divisible by 25, and factoring out 25 makes this divisibility explicit.
  6. Step 6: Let \( k = \binom{n}{2} + \binom{n}{3}5 + \cdots + \binom{n}{n}5^{n-2} \). Since every \( \binom{n}{r} \) is a non-negative integer for whole number \( n \), \( k \) is itself a whole number. Therefore: \[6^n - 5n = 1 + 25k.\] Reason: Naming the bracketed sum \( k \) confirms it is a non-negative integer, which is the precise algebraic condition for \( 6^n - 5n \) to leave remainder 1 when divided by 25.

Final 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.

Common Mistake

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.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Write \( 6^n = (1 + 5)^n \) and expand: \[6^n = \binom{n}{0} + \binom{n}{1}5 + \binom{n}{2}5^2 + \binom{n}{3}5^3 + \cdots + \binom{n}{n}5^n\]
  2. Step 2: Simplify the first two terms using \( \binom{n}{0} = 1 \) and \( \binom{n}{1} = n \): \[6^n = 1 + 5n + \binom{n}{2}5^2 + \binom{n}{3}5^3 + \cdots + \binom{n}{n}5^n\]
  3. Step 3: Subtract \( 5n \) from both sides: \[6^n - 5n = 1 + 5^2\!\left[\binom{n}{2} + \binom{n}{3}5 + \cdots + \binom{n}{n}5^{n-2}\right] = 1 + 25k\] where \( k = \binom{n}{2} + \binom{n}{3}5 + \cdots + \binom{n}{n}5^{n-2} \) is a whole number.

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.

➕ More Examples

More Examples

Example 1

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)

Example 2

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)

🎯 Try a Similar Question

Try a Similar Question

Question: Using the Binomial Theorem, prove that \( 7^n - 6n \) always leaves remainder \( 1 \) when divided by \( 36 \), for all positive integers \( n \).

Solution

  1. Step 1: Rewrite the base using a suitable form: Write \( 7 = 1 + 6 \), so that \( 7^n = (1 + 6)^n \).
  2. Step 2: Expand using the Binomial Theorem: Applying the Binomial Theorem: \[(1 + 6)^n = \sum_{r=0}^{n} \binom{n}{r} 6^r\] Expanding the first few terms explicitly: \[7^n = \binom{n}{0} 6^0 + \binom{n}{1} 6^1 + \binom{n}{2} 6^2 + \binom{n}{3} 6^3 + \cdots + \binom{n}{n} 6^n\] which gives \[7^n = 1 + 6n + \binom{n}{2} \cdot 36 + \binom{n}{3} \cdot 6^3 + \cdots + 6^n.\]
  3. Step 3: Subtract 6n from both sides: Subtracting \( 6n \) from both sides: \[7^n - 6n = 1 + \binom{n}{2} \cdot 36 + \binom{n}{3} \cdot 6^3 + \cdots + 6^n.\]
  4. Step 4: Factor out 36 from the remaining terms: Observe that every term from the third onward contains \( 6^2 = 36 \) as a factor. Specifically, \( 6^r \) for \( r \ge 2 \) is divisible by \( 36 \). So we can write: \[7^n - 6n = 1 + 36\left[\binom{n}{2} + \binom{n}{3} \cdot 6 + \binom{n}{4} \cdot 6^2 + \cdots + 6^{n-2}\right].\]
  5. Step 5: Define the integer k and conclude: Let \[k = \binom{n}{2} + \binom{n}{3} \cdot 6 + \cdots + 6^{n-2},\] which is a non-negative integer for all positive integers \( n \). Then \[7^n - 6n = 1 + 36k.\] This means \( 7^n - 6n \) 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 \).

Everything you get with Solver7

More questions in Binomial Theorem