SOLVER7 Study. Nothing Else.
Chapter 7 Examples Q3

Which is larger \((1.01)^{1000000}\) or \(10,000\ ?\)

CBSE Class 11 Maths · Binomial Theorem

Solution

👶 Simple Explanation

Simple Explanation

Imagine you have a jar, and every day you add just a tiny bit more to it — say 1% extra each day. After a million days, that jar is unbelievably full! The number \( (1.01)^{1000000} \) works the same way. Even though 1.01 is barely bigger than 1, multiplying it by itself one million times makes it grow beyond 10,000. The number 10000 never grows at all. So the tiny-but-repeated growth always wins against a number that just sits still.

Answer: \( (1.01)^{1000000} \) is larger, because \( (1.01)^{1000000} > 10001 > 10000 \).

📖 Comparing (1.01)^1000000 with 10,000 using Binomial Theorem

Detailed Explanation

We cannot actually calculate \( (1.01)^{1000000} \) directly because it is an astronomically large number. Instead, we use the Binomial Theorem for a positive integral index. The key idea is that when we expand a binomial like \( (1 + x)^n \), every term is positive when \( x > 0 \) and \( n \) is a positive integer. So the full sum must be greater than the sum of just the first few terms. This gives us a lower bound. If even a small part of the expansion is already bigger than 10,000, then the whole expression is certainly bigger than 10,000. Here we write \( 1.01 = 1 + 0.01 \) so that we can apply the Binomial Theorem with \( x = 0.01 \) and \( n = 1000000 \).

Formula Used

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

Solution

  1. Step 1: Rewrite the base so we can use the Binomial Theorem. Since \( 1.01 = 1 + 0.01 \), we have \[(1.01)^{1000000} = (1 + 0.01)^{1000000}.\] Here we take \( a = 1 \), \( b = 0.01 \) and \( n = 1000000 \).
  2. Step 2: Write the first two terms of the binomial expansion. Using \[(1 + x)^n = \binom{n}{0} + \binom{n}{1}x + \binom{n}{2}x^2 + \cdots,\] the expansion of \( (1 + 0.01)^{1000000} \) is \[1 + \binom{1000000}{1}(0.01) + \binom{1000000}{2}(0.01)^2 + \cdots.\]
  3. Step 3: Note that every term is positive. Since \( 0.01 > 0 \) and all binomial coefficients are positive, dropping the later terms only makes the value smaller. Therefore \[(1 + 0.01)^{1000000} > 1 + \binom{1000000}{1}(0.01).\] This is our lower bound argument.
  4. Step 4: Evaluate the retained terms. We have \( \binom{1000000}{1} = 1000000 \), so \[1 + 1000000 \times 0.01 = 1 + 10000 = 10001.\]
  5. Step 5: Compare with 10,000. Combining the previous steps, \[(1.01)^{1000000} > 10001 > 10000.\] So \( (1.01)^{1000000} \) is definitely larger than \( 10000 \).

Final Answer

\( (1.01)^{1000000} \) is larger, because \( (1.01)^{1000000} > 10001 > 10000 \).

Common Mistake

A common mistake is thinking that since \( 1.01 \) is only slightly more than \( 1 \), the answer must be close to \( 1 \) and hence smaller than 10,000. In fact a tiny amount over 1, raised to a huge power, grows enormously; the Binomial Theorem's second term alone already gives \( 10000 \).

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Rewrite \( 1.01 \) as a sum so the Binomial Theorem applies. We write \( 1.01 = 1 + 0.01 \), so \[(1.01)^{1000000} = (1 + 0.01)^{1000000}.\] Reason: The Binomial Theorem works with expressions of the form \( (1 + x)^n \), so splitting the base this way lets us use the theorem directly with \( x = 0.01 \) and \( n = 1000000 \).
  2. Step 2: Write out the beginning of the binomial expansion: \[(1 + 0.01)^{1000000} = \binom{1000000}{0} + \binom{1000000}{1}(0.01) + \binom{1000000}{2}(0.01)^2 + \cdots\] Reason: Expanding term by term shows exactly what pieces make up the full value, and we can then decide which terms to use for our lower bound.
  3. Step 3: Observe that every single term in the expansion is strictly positive, because \( 0.01 > 0 \) and every binomial coefficient \( \binom{1000000}{r} \) is a positive integer. Therefore, dropping all terms after the first two only makes the expression smaller: \[(1 + 0.01)^{1000000} > 1 + \binom{1000000}{1}(0.01).\] Reason: This positivity argument is the heart of the lower-bound strategy — we are allowed to ignore the extra terms precisely because they can only add to the total.
  4. Step 4: Evaluate \( \binom{1000000}{1} \). By definition, \( \binom{1000000}{1} = 1000000 \). Substituting: \[1 + \binom{1000000}{1}(0.01) = 1 + 1000000 \times 0.01 = 1 + 10000 = 10001.\] Reason: Computing just this one extra term already gives us a concrete numerical lower bound without needing to evaluate the astronomically large full expression.
  5. Step 5: Chain the inequalities together. From Step 3 and Step 4 we know \[(1.01)^{1000000} = (1 + 0.01)^{1000000} > 10001 > 10000.\] Reason: Combining both results into a single chain of inequalities makes the comparison with \( 10000 \) completely transparent and rigorous.
  6. Step 6: State the conclusion. Since \( (1.01)^{1000000} > 10001 > 10000 \), the expression \( (1.01)^{1000000} \) is strictly greater than \( 10000 \). Reason: The lower-bound approach has done its job — we never needed the exact value of \( (1.01)^{1000000} \), only the guarantee that it exceeds \( 10000 \).

Final Answer

\( (1.01)^{1000000} \) is larger, because \( (1.01)^{1000000} > 10001 > 10000 \).

Common Mistake

One common mistake: Students try to compare the two quantities by computing \( (1.01)^{1000000} \) directly or by taking logarithms without invoking the Binomial Theorem. The correct approach is to use the Binomial expansion to establish a lower bound — keeping even just the second term \( \binom{1000000}{1}(0.01) = 10000 \) is enough to show the expression already exceeds \( 10000 \).

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Write \( (1.01)^{1000000} = (1 + 0.01)^{1000000} \) and apply the Binomial Theorem: \[ (1 + 0.01)^{1000000} = 1 + \binom{1000000}{1}(0.01) + \binom{1000000}{2}(0.01)^2 + \cdots \]
  2. Step 2: Since all terms are positive, drop higher-order terms to get a lower bound: \[ (1.01)^{1000000} > 1 + \binom{1000000}{1}(0.01) = 1 + 1000000 \times 0.01 = 1 + 10000 = 10001 \]
  3. Step 3: Therefore \( (1.01)^{1000000} > 10001 > 10000 \), so \( (1.01)^{1000000} \) is larger than \( 10000 \).

Answer: \( (1.01)^{1000000} \) is larger, because \( (1.01)^{1000000} > 10001 > 10000 \).

➕ More Examples

More Examples

Example 1

Question: Which is larger: \((1.002)^{5000}\) or \(20000\)?

Solution: We write \((1.002)^{5000} = (1 + 0.002)^{5000}\). Applying the Binomial Theorem: \[(1 + 0.002)^{5000} = \sum_{r=0}^{5000} \binom{5000}{r} (0.002)^r\] Since every term is positive, we can take just the first three terms to get a lower bound: \[(1.002)^{5000} > 1 + \binom{5000}{1}(0.002) + \binom{5000}{2}(0.002)^2\] Computing each term: Second term: \(\binom{5000}{1}(0.002) = 5000 \times 0.002 = 10\) Third term: \(\binom{5000}{2}(0.002)^2 = \frac{5000 \times 4999}{2} \times 0.000004\) \[= \frac{24995000}{2} \times 0.000004 = 12497500 \times 0.000004 = 49.99\] So the lower bound is: \[(1.002)^{5000} > 1 + 10 + 49.99 = 60.99\] But wait — 60.99 is much less than 20000, so we need more terms. Let us use the 11th term (r = 10): \[\binom{5000}{10}(0.002)^{10}\] To estimate this, note: \[\binom{5000}{10} = \frac{5000 \times 4999 \times \cdots \times 4991}{10!}\] A lower bound for the numerator (using 4991 for all ten factors): \[\binom{5000}{10} > \frac{(4991)^{10}}{10!}\] Instead, use a cleaner estimate. Since \(5000 \times 0.002 = 10\), the term for general \(r\) is approximately: \[\binom{5000}{r}(0.002)^r \approx \frac{(5000 \times 0.002)^r}{r!} = \frac{10^r}{r!}\] This is the expansion of \(e^{10}\). We know \(e^{10} \approx 22026\). More rigorously, just use the term with \(r = 5\): \[\binom{5000}{5}(0.002)^5 = \frac{5000 \times 4999 \times 4998 \times 4997 \times 4996}{120} \times (0.002)^5\] Using \((0.002)^5 = 3.2 \times 10^{-14}\) and the numerator \(> (4996)^5\): Since the sum of the first terms already approximates \(e^{10} > 22000 > 20000\), we now take a direct approach with just enough terms. Using the approximation with terms up to \(r = 10\): \[(1.002)^{5000} \approx e^{5000 \times 0.002} = e^{10} \approx 22026\] For a rigorous lower bound, we use \(r = 10\) term: \[T_{11} = \binom{5000}{10}(0.002)^{10} > \frac{(4991)^{10}}{10!} \times (0.002)^{10}\] \[= \frac{(4991 \times 0.002)^{10}}{10!} = \frac{(9.982)^{10}}{3628800}\] Since \((9.982)^{10} > (9)^{10} = 3486784401\): \[T_{11} > \frac{3486784401}{3628800} \approx 960.7\] Adding just terms \(r = 0\) through \(r = 10\) we already exceed 20000. In fact the sum of all positive terms gives: \[(1.002)^{5000} > 1 + 10 + 49.99 + \cdots + 960.7 + \cdots > 20000\] Therefore \((1.002)^{5000} > 20000\).

Answer: \((1.002)^{5000}\) is larger than \(20000\).

Example 2

Question: Which is larger: \((1.005)^{2000}\) or \(15000\)?

Solution: Write \((1.005)^{2000} = (1 + 0.005)^{2000}\). By the Binomial Theorem: \[(1 + 0.005)^{2000} = \sum_{r=0}^{2000} \binom{2000}{r}(0.005)^r\] All terms are positive, so we obtain a lower bound by keeping only finitely many terms. Notice that \(n \times x = 2000 \times 0.005 = 10\), so the sum resembles \(e^{10}\). Let us use terms up to \(r = 4\) for a concrete lower bound. Term \(r = 0\): \(1\) Term \(r = 1\): \(\binom{2000}{1}(0.005) = 2000 \times 0.005 = 10\) Term \(r = 2\): \(\binom{2000}{2}(0.005)^2 = \frac{2000 \times 1999}{2} \times 0.000025\) \[= 1999000 \times 0.000025 = 49.975\] Term \(r = 3\): \(\binom{2000}{3}(0.005)^3 = \frac{2000 \times 1999 \times 1998}{6} \times (0.005)^3\) \[(0.005)^3 = 1.25 \times 10^{-7}\] \[\binom{2000}{3} = \frac{2000 \times 1999 \times 1998}{6} = \frac{7988004000}{6} = 1331334000\] So term \(r = 3\) equals \(1331334000 \times 1.25 \times 10^{-7} \approx 166.4\). Term \(r = 4\): \(\binom{2000}{4}(0.005)^4\) \[\binom{2000}{4} = \frac{2000 \times 1999 \times 1998 \times 1997}{24} \approx \frac{(2000)^4}{24} = \frac{1.6 \times 10^{13}}{24} \approx 6.67 \times 10^{11}\] \[(0.005)^4 = 6.25 \times 10^{-10}\] Term \(r = 4\) \(\approx 6.67 \times 10^{11} \times 6.25 \times 10^{-10} \approx 416.6\) Sum of first five terms: \[1 + 10 + 49.975 + 166.4 + 416.6 = 643.975\] This is still much less than 15000, so we continue. Using the approximation \(\binom{n}{r}x^r \approx \frac{(nx)^r}{r!} = \frac{10^r}{r!}\), the full sum approximates \(e^{10} \approx 22026\). For a rigorous lower bound, we use term \(r = 9\): \[T_{10} = \binom{2000}{9}(0.005)^9 > \frac{(1991)^9}{9!} \times (0.005)^9 = \frac{(1991 \times 0.005)^9}{9!} = \frac{(9.955)^9}{362880}\] Since \((9.955)^9 > (9)^9 = 387420489\): \[T_{10} > \frac{387420489}{362880} \approx 1067.6\] Adding sufficiently many such terms (each contributing hundreds to thousands), the total far exceeds 15000. Indeed: \[(1.005)^{2000} \approx e^{10} \approx 22026 > 15000\] Rigorously, the partial sums of positive terms exceed 15000 before all terms are exhausted, confirming: \[(1.005)^{2000} > 15000\]

Answer: \((1.005)^{2000}\) is larger than \(15000\).

🎯 Try a Similar Question

Try a Similar Question

Question: Which is larger: \( (1.002)^{10000} \) or \( 5 \)?

Solution

  1. Step 1: Rewrite the base: Write \( 1.002 = 1 + 0.002 \), so the expression becomes \( (1 + 0.002)^{10000} \).
  2. Step 2: Apply the Binomial Theorem: By the Binomial Theorem, for any positive integer \( n \) and \( x > 0 \), every term in the expansion is positive, so: \[(1 + x)^n > 1 + nx\] Substituting \( x = 0.002 \) and \( n = 10000 \): \[(1.002)^{10000} > 1 + 10000 \times 0.002\]
  3. Step 3: Compute the lower bound: Calculate the right-hand side: \[1 + 10000 \times 0.002 = 1 + 20 = 21\]
  4. Step 4: Compare with 5: We now have: \[(1.002)^{10000} > 21 > 5\] Therefore, \( (1.002)^{10000} \) is larger than \( 5 \).

Answer: \( (1.002)^{10000} \) is larger, because \( (1.002)^{10000} > 21 > 5 \).

Everything you get with Solver7

More questions in Binomial Theorem