On this page
Why does 1.01¹⁰⁰⁰⁰⁰⁰ look deceivingly small?
At first glance, comparing 1.01¹⁰⁰⁰⁰⁰⁰ to 10,000 feels counterintuitive. Because 1.01 is only one-hundredth greater than 1, common intuition suggests that multiplying it repeatedly will cause it to grow very slowly. However, an exponent of one million (10⁶) represents a massive compounding process. As presented in the official NCERT Class 11 Mathematics textbook (Chapter 7, Example 3), evaluating this power directly by long multiplication is impossible by hand, and ordinary scientific calculators simply return an overflow error because the actual value is roughly 2.36 × 10⁴³²¹—a number possessing more than 4,300 digits.
Rather than attempting complex numerical approximations or computing high-precision logarithms, the NCERT syllabus uses this problem to teach a core algebraic principle: expanding just the first two terms of the binomial theorem establishes a definitive comparison in seconds.
How does the two-term binomial expansion work?
The method begins by separating the base into 1 and its decimal increment: 1.01 = 1 + 0.01. According to the binomial theorem for any positive integer exponent n, as detailed in NCERT Class 11 Mathematics:
(1 + x)ⁿ = ⁿC₀ + ⁿC₁ x + ⁿC₂ x² + ⁿC₃ x³ + ... + ⁿCₙ xⁿ
Substituting x = 0.01 and n = 1,000,000 into the expansion allows us to compute the initial terms directly:
The constant first term is ⁿC₀ = 1.
The linear second term is ⁿC₁ (0.01) = 1,000,000 × 0.01 = 10,000.
Summing these two terms produces 1 + 10,000 = 10,001.
The sum of just the first two terms is 10,001. Because 10,001 is already strictly greater than 10,000, the complete value of 1.01¹⁰⁰⁰⁰⁰⁰ must surpass 10,000, provided that the remaining 999,999 terms do not reduce the total. Understanding how individual terms contribute to the whole connects directly to sums of binomial coefficients and classical algebraic proofs seen in Al-Karaji and early binomial induction.
Why is dropping positive terms mathematically safe?
Students learning this shortcut often wonder whether dropping the rest of the expansion is legally sound in a proof. In physics numericals or calculus approximations, neglecting higher-order terms introduces an approximation error. Why does that error not invalidate our comparison here?
The distinction lies between calculating an approximate equality and establishing a strict inequality. When you approximate a value, dropping terms creates an error because you are claiming equality (=). However, when comparing two quantities, you only need to prove an inequality (>). In the real number system, if a quantity satisfies A = B + C where C > 0, then the strict inequality A > B is exact and indisputable.
In the expansion of (1 + 0.01)¹⁰⁰⁰⁰⁰⁰, every term after the first two takes the form ⁿCₖ (0.01)ᵏ for k ≥ 2. Because n = 1,000,000 is a positive integer and 0.01 is positive, every combinatorial coefficient ⁿCₖ is a positive integer and every power (0.01)ᵏ is positive. Therefore, the remaining 999,999 terms are all strictly positive numbers:
(1.01)¹⁰⁰⁰⁰⁰⁰ = 10,001 + (sum of remaining positive terms) > 10,000
This principle forms the foundation of Bernoulli's inequality, first published by Swiss mathematician Jacob Bernoulli in his 1689 treatise *Positiones Arithmeticae de Seriebus Infinitis*. The theorem states that (1 + x)ⁿ ≥ 1 + nx for any real number x ≥ -1 and positive integer n. A geometric proof in Mathematics Magazine shows that this inequality is strict whenever x > 0 and n ≥ 2. Truncating the positive higher-order terms merely replaces the rapidly curving exponential graph with its tangent linear lower bound.
How do you apply this method in JEE and CBSE exams?
In CBSE examinations and competitive exams such as JEE Main, examiners design large-exponent problems to test whether you recognise algebraic lower bounds or waste time attempting logarithmic estimates. You can apply this method reliably using a three-step routine:
Express the base in the form 1 + x, confirming that x is strictly positive.
Calculate the first two terms: 1 + nx.
Compare 1 + nx with the target threshold; if 1 + nx exceeds or equals the threshold, the full power is guaranteed to be larger.
For example, Question 10 of Exercise 7.1 in NCERT Class 11 Mathematics asks students to determine which number is larger: (1.1)¹⁰⁰⁰⁰ or 1,000. Applying the two-term test:
(1 + 0.1)¹⁰⁰⁰⁰ = 1 + (10,000 × 0.1) + positive terms = 1,001 + positive terms > 1,000
A critical condition is that x must be positive. If the base were 0.99, written as (1 − 0.01)¹⁰⁰⁰⁰⁰⁰, the terms would alternate in sign (+, −, +, −), meaning truncation would not automatically guarantee a lower bound without bounding the alternating remainder. When a tighter lower bound is required for positive increments, retaining higher-order terms—such as the quadratic term n(n − 1)x² / 2—yields a stronger lower bound, as analyzed in The Mathematical Intelligencer. Similar exponential compounding principles arise when resolving limits of the form 1^∞ in calculus.
When competitive exam questions tweak these exponents or introduce negative terms, spotting whether an approximation or an exact inequality is needed can feel tricky. The Fermi Problem Library has worked problems with a step-by-step solver that explains the reasoning rather than printing an answer, helping you see when truncation yields a safe bound.
If you want to explore the progression from binomial expansions to other algebraic patterns, the Fermi Concept Library maps every concept in physics, chemistry, biology, mathematics and computing, each with its own lesson and its place in the map.
