๐Ÿงฎ Brain Teaser

Truncated Exponential Has No Repeated Roots

Problem

Define the truncated exponential polynomial: pn(x)=1+x+x22!+x33!+โ‹ฏ+xnn!p_n(x) = 1 + x + \frac{x^2}{2!} + \frac{x^3}{3!} + \cdots + \frac{x^n}{n!}

Prove that pn(x)p_n(x) has no repeated real roots for any nโ‰ฅ1n \geq 1.


Field

Putnam / Analysis / Polynomials

Why It's Beautiful

The truncated exponentials are the partial sums of exe^x. They look complicated โ€” their roots spread out in the complex plane and have no closed form. Yet the statement that they have no repeated real roots admits a 3-line proof from a single elegant observation.

The key identity pn(x)=pnโˆ’1(x)+xn/n!p_n(x) = p_{n-1}(x) + x^n/n! is obvious once written down, but using it to kill repeated roots requires a small, satisfying twist.

Key Idea / Trick

A repeated root rr of pnp_n satisfies both pn(r)=0p_n(r) = 0 and pnโ€ฒ(r)=0p_n'(r) = 0.

Note that pnโ€ฒ(x)=pnโˆ’1(x)p_n'(x) = p_{n-1}(x), so pnโˆ’1(r)=0p_{n-1}(r) = 0.

But pn(x)=pnโˆ’1(x)+xnn!p_n(x) = p_{n-1}(x) + \dfrac{x^n}{n!}, so 0=0+rnn!0 = 0 + \dfrac{r^n}{n!}, giving r=0r = 0.

Yet pn(0)=1โ‰ 0p_n(0) = 1 \neq 0. Contradiction.

Difficulty

2 / 5

Tags

Putnam, Polynomials, Repeated roots, Derivatives, Truncated exponential, Elegant identity

PolynomialsRepeated rootsDerivativesTruncated exponential

Truncated Exponential Has No Repeated Roots โ€” Answer

Key Identity

Observe that consecutive truncated exponentials differ by exactly one term: p_n(x) = p_{n-1}(x) + \frac{x^n}{n!} \tag{$*$}

And differentiating pnp_n gives: p_n'(x) = p_{n-1}(x) \tag{$**$}


Proof

Suppose rโˆˆRr \in \mathbb{R} is a repeated root of pnp_n. Then:

pn(r)=0andpnโ€ฒ(r)=0p_n(r) = 0 \quad \text{and} \quad p_n'(r) = 0

From (โˆ—โˆ—)(**): pnโ€ฒ(r)=pnโˆ’1(r)=0p_n'(r) = p_{n-1}(r) = 0.

Substituting both pn(r)=0p_n(r) = 0 and pnโˆ’1(r)=0p_{n-1}(r) = 0 into (โˆ—)(*): 0=0+rnn!0 = 0 + \frac{r^n}{n!}

So rn=0r^n = 0, which forces r=0r = 0.

But pn(0)=1โ‰ 0p_n(0) = 1 \neq 0, contradicting pn(r)=0p_n(r) = 0. โ– \blacksquare


Why the Identity (โˆ—)(*) Is the Right Tool

A repeated root rr of a polynomial ff is a common root of ff and fโ€ฒf'. Normally, finding gcdโก(f,fโ€ฒ)\gcd(f, f') requires the Euclidean algorithm. Here, the relationship pnโ€ฒ=pnโˆ’1p_n' = p_{n-1} means fโ€ฒf' is almost ff itself โ€” just with the leading term removed. That's what makes (โˆ—)(*) lethal: it directly computes fโˆ’(leadingย term)=fโ€ฒf - \text{(leading term)} = f', so any common root must kill the leading term.


Bonus: Behavior of Roots

  • For nn odd: pn(x)โ†’ยฑโˆžp_n(x) \to \pm\infty as xโ†’ยฑโˆžx \to \pm\infty, so pnp_n has at least one real root (in fact, exactly one).
  • For nn even: pn(x)โ†’+โˆžp_n(x) \to +\infty as xโ†’ยฑโˆžx \to \pm\infty, and pn>0p_n > 0 everywhere (since the minimum of exโˆ’pn(x)e^x - p_n(x), which is โˆ‘k>nxk/k!\sum_{k>n} x^k/k!, is non-negative for even nn and xโ‰ฅ0x \geq 0). So pnp_n has no real roots at all when nn is even.

In all cases, no real root is repeated.