Tutorials › AP Calculus › Exponential Growth Versus Polynomial Growth

Sequences and Series Foundations · Tutorial 811 of 999

Exponential Growth Versus Polynomial Growth

Use a binomial bound or a consecutive-term ratio to decide whether an exponential or polynomial factor controls a sequence’s limit.

Intermediate 8 min read

What You'll Learn

  • Compare powers of n with \(r^n\) when \(r>1\)
  • Prove that \(n^d/r^n\) approaches zero for fixed nonnegative integer \(d\)
  • Use a consecutive-term ratio to bound a sequence
  • Extend the comparison to polynomial numerators
  • Determine when exponential-over-polynomial sequences grow without bound
  • Avoid treating an indeterminate form as a limit

Why Compare Exponential and Polynomial Growth?

Some sequences have a polynomial factor that increases with \(n\), while another factor changes exponentially. For example, \(n^3\) grows as a power of \(n\), whereas \(2^n\) multiplies by \(2\) each time \(n\) increases by \(1\). At first, both factors may become large, so comparing their limits by appearance alone is not enough.

The key result is that, for a fixed base greater than \(1\), exponential growth eventually outpaces every fixed nonnegative integer power of \(n\). This lets us evaluate many sequence limits without expanding large powers or relying on a table of terms.

Key result: If \(r>1\) and \(d\) is a fixed nonnegative integer, then \(\frac{n^d}{r^n}\to 0\) as \(n\to\infty\). Consequently, \(\frac{r^n}{n^d}\to+\infty\).

A Proof Using the Binomial Theorem

Write \(r=1+c\), where \(c=r-1>0\). The binomial theorem gives a useful lower bound for \(r^n=(1+c)^n\). Choose an integer \(m>d\). For \(n\ge 2m\), one term in the binomial expansion is \(\binom{n}{m}c^m\), and all terms are nonnegative. Therefore \(r^n\ge \binom{n}{m}c^m\).

To bound the binomial coefficient, write it as a product. When \(n\ge 2m\), every factor \(n-j\), for \(j=0,1,\ldots,m-1\), is at least \(n/2\). Thus \(\binom{n}{m}\ge \frac{(n/2)^m}{m!}\). Combining these inequalities gives a bound on the original sequence.

$$ r^n \ge \binom{n}{m}c^m \ge \frac{n^m c^m}{2^m m!} $$

Since \(n^d\) and \(r^n\) are positive, dividing by the lower bound for \(r^n\) reverses its effect on the quotient in the appropriate way: a larger denominator gives a smaller quotient. Hence, for \(n\ge 2m\),

$$ 0\le \frac{n^d}{r^n} \le \frac{2^m m!}{c^m}\,n^{d-m}. $$

The constant \(\frac{2^m m!}{c^m}\) does not depend on \(n\), and \(d-m<0\). The right-hand side is therefore a constant times \(\frac{1}{n^{m-d}}\), which approaches zero by the limits of polynomial and rational sequences. The Squeeze Theorem now proves the claimed limit.

Theorem: For every real \(r>1\) and every fixed nonnegative integer \(d\), \(\lim_{n\to\infty}\frac{n^d}{r^n}=0\). The proof works because the binomial expansion supplies a power of \(n\) higher than \(n^d\) in a lower bound for \(r^n\).

Worked Example: A Cubic Power Divided by \(2^n\)

Worked Example: A Cubic Power Divided by \(2^n\)

Evaluate \(\lim_{n\to\infty}\frac{n^3}{2^n}\) by comparing consecutive terms.

Let \(a_n=\frac{n^3}{2^n}\), which is positive. The ratio of consecutive terms is

$$ \frac{a_{n+1}}{a_n} = \frac{(n+1)^3}{2^{n+1}}\cdot\frac{2^n}{n^3} = \frac{(n+1)^3}{2n^3} = \frac{(1+1/n)^3}{2}. $$

For \(n\ge 4\), \(1+\frac1n\le\frac54\). Therefore

$$ \frac{a_{n+1}}{a_n} \le \frac{(5/4)^3}{2} =\frac{125}{128}. $$

Also \(a_4=\frac{4^3}{2^4}=\frac{64}{16}=4\). Repeatedly applying the ratio bound gives \(a_n\le 4(\frac{125}{128})^{n-4}\) for \(n\ge4\). To check that the factor on the right approaches zero, note that \(\frac{128}{125}=1+\frac{3}{125}\). The binomial theorem implies \((\frac{128}{125})^k\ge 1+\frac{3k}{125}\), so \((\frac{125}{128})^k\le\frac{1}{1+3k/125}\to0\).

Thus the bound on \(a_n\) approaches zero, and \(a_n\ge0\). By the Squeeze Theorem, \(\lim_{n\to\infty}a_n=0\). The result is consistent with the original expression: its terms are positive and eventually bounded above by a quantity as small as desired.

$$ \boxed{\lim_{n\to\infty}\frac{n^3}{2^n}=0} $$

Using the Result for a Polynomial Numerator

The theorem also applies when the numerator is a polynomial rather than a single power. Let \(P(n)=a_dn^d+\cdots+a_1n+a_0\), where \(d\) is fixed. For \(n\ge1\), each \(n^j\) with \(0\le j\le d\) is at most \(n^d\). The triangle inequality therefore gives \(|P(n)|\le Cn^d\), where \(C=|a_0|+\cdots+|a_d|\). For \(r>1\),

$$ 0\le \frac{|P(n)|}{r^n} \le C\frac{n^d}{r^n}\longrightarrow 0. $$

The Squeeze Theorem shows that \(\frac{P(n)}{r^n}\to0\), whether the polynomial takes positive or negative values. This bound is useful because it reduces a polynomial numerator to its highest power without requiring a separate limit calculation for every term.

Worked Example: A Fifth Power Divided by \(3^n\)

Evaluate \(\lim_{n\to\infty}\frac{n^5}{3^n}\) with an explicit bound.

Write \(3^n=(1+2)^n\). For \(n\ge12\), the binomial theorem gives \(3^n\ge \binom{n}{6}2^6\). In the product for \(\binom{n}{6}\), the factors \(n,n-1,\ldots,n-5\) are each at least \(n/2\), so

$$ \binom{n}{6} =\frac{n(n-1)(n-2)(n-3)(n-4)(n-5)}{720} \ge \frac{(n/2)^6}{720} =\frac{n^6}{46080}. $$

Since \(2^6=64\), it follows that \(3^n\ge64\frac{n^6}{46080}=\frac{n^6}{720}\). Therefore

$$ 0\le\frac{n^5}{3^n} \le\frac{n^5}{n^6/720} =\frac{720}{n}. $$

The upper bound approaches zero, so the Squeeze Theorem gives \(\lim_{n\to\infty}\frac{n^5}{3^n}=0\). The bound also verifies the conclusion directly: for any \(\varepsilon>0\), choosing an integer \(n>\frac{720}{\varepsilon}\), with \(n\ge12\), makes the sequence term less than \(\varepsilon\).

$$ \boxed{\lim_{n\to\infty}\frac{n^5}{3^n}=0} $$

When the Exponential Is in the Numerator

If \(r>1\), \(d\) is a nonnegative integer, and \(n\ge1\), then \(\frac{r^n}{n^d}\) is the reciprocal of the positive quantity \(\frac{n^d}{r^n}\). Since that quantity approaches zero, its reciprocal grows without bound. In precise terms, if \(M>0\), the limit \(\frac{n^d}{r^n}\to0\) ensures that for sufficiently large \(n\), \(0<\frac{n^d}{r^n}<\frac1M\). Taking reciprocals gives \(\frac{r^n}{n^d}>M\). This is exactly the definition that the sequence tends to \(+\infty\).

Worked Example: An Exponential Divided by a Cubic Power

Evaluate \(\lim_{n\to\infty}\frac{4^n}{n^3}\).

Apply the proved result with \(r=4\) and \(d=3\): \(\frac{n^3}{4^n}\to0\). Both \(n^3\) and \(4^n\) are positive for positive integers \(n\), so the reciprocal argument applies. Given any \(M>0\), there is an \(N\) such that \(n\ge N\) implies \(0<\frac{n^3}{4^n}<\frac1M\). Taking reciprocals yields \(\frac{4^n}{n^3}>M\). Because this holds for every positive \(M\), the sequence tends to \(+\infty\).

$$ \boxed{\lim_{n\to\infty}\frac{4^n}{n^3}=+\infty} $$

As a check, the result has the expected direction: the exponential is in the numerator, and the reciprocal sequence has just been shown to approach zero through positive values.

How the Base Changes the Comparison

The condition \(r>1\) matters. If \(r=1\), then \(\frac{n^d}{r^n}=n^d\), which does not approach zero when \(d>0\); for \(d=0\), it equals \(1\). If \(0<r<1\), then \(r^n\) decreases toward zero, so \(\frac{n^d}{r^n}\) does not tend to zero. Indeed, writing \(s=1/r>1\) gives \(\frac{n^d}{r^n}=n^d s^n\), which grows without bound for \(d\ge0\). The comparison theorem is specifically for a fixed base greater than one in the exponential denominator.

For a general polynomial numerator and \(r>1\), the bound by \(Cn^d\) proves that its quotient by \(r^n\) tends to zero. The same reasoning does not say that every expression involving a power and an exponential has the same limit: the location of the factors and the value of the base are essential.

A Common Mistake: Comparing Two Infinite Quantities

A tempting but incorrect argument is: “Both \(n^3\) and \(2^n\) approach infinity, so their quotient approaches \(1\).” Knowing that the numerator and denominator separately grow without bound does not determine the limit of their quotient. For this specific example, the quotient actually approaches zero, as the consecutive-term bound showed.

Another invalid shortcut is to treat the notation \(\infty/\infty\) as an arithmetic calculation. Infinity is not a real number that can be substituted into a fraction. Instead, identify the form as indeterminate and establish a comparison, such as the binomial lower bound or a ratio bound. These methods show which factor controls the limit and justify the conclusion.

Takeaway: When \(r>1\), exponential growth dominates every fixed polynomial power: \(\frac{n^d}{r^n}\to0\), while \(\frac{r^n}{n^d}\to+\infty\). Prove the comparison with a bound; do not infer a quotient limit just from the separate behavior of its numerator and denominator.

Check Your Understanding

For each question, state the limit and identify the comparison that justifies it.

  1. Evaluate \(\lim_{n\to\infty}\frac{n^4}{5^n}\).
  2. Evaluate \(\lim_{n\to\infty}\frac{2^n}{n^6}\).
  3. Why does the theorem require \(r>1\) when studying \(\frac{n^d}{r^n}\)?
  4. For a polynomial \(P(n)\) of degree \(d\), explain why \(|P(n)|\le Cn^d\) for \(n\ge1\), for some constant \(C\).
  5. Identify the error in the claim “\(n^2\) and \(3^n\) both approach infinity, so \(\frac{n^2}{3^n}\) approaches \(1\).”

Want all 1,114 practice problems?

This tutorial covers one topic. Calc Pass covers all of AP Calculus AB & BC: full review, every practice question, and step-by-step solutions to each one.

QR code to download the Calc Pass app

Get the Calc Pass App

Scan to download and practice on the go, with instant scoring.

Calc Pass Volume 1: 1,114 Practice Questions book cover

Vol. 1: 1,114 Questions

The complete practice question bank, organized by AB & BC topic.

View on Amazon
Calc Pass Volume 2: Solutions Manual book cover

Vol. 2: Solutions Manual

Fully worked solutions to every question in Volume 1.

View on Amazon