← All parts of this equation

Equation 19 · Part 18 · The Economics and Physical Limits of Running AI Agents at Scale

Ending index or upper bound: n

Cn=∑i=1nci=n pin(τ+δ)+pin σ n(n−1)2+n pout oˉC_n = \sum_{i=1}^{n} c_i = n\,p_{\text{in}}(\tau+\delta) + p_{\text{in}}\,\sigma\,\frac{n(n-1)}{2} + n\,p_{\text{out}}\,\bar{o}
nn

What this part means

This label says where the repeated addition, multiplication, or accumulation stops. It sets the last term or end of the range.

Its job in the formula

n occurs above the fraction bar. The numerator is divided by the entire denominator below it.

The passage around this formula

Summed over an n -step trajectory, that gives Cn=∑i=1nci=n pin(τ+δ)+pin σ n(n−1)2+n pout oˉC_n = \sum_{i=1}^{n} c_i = n\,p_{\text{in}}(\tau+\delta) + p_{\text{in}}\,\sigma\,\frac{n(n-1)}{2} + n\,p_{\text{out}}\,\bar{o}. The middle term is the one that matters. It grows as n(n-1)/2 — quadratically in step count — while the other two terms grow only linearly. For a short loop, the quadratic term is negligible next to the fixed tax and the output cost. For a long one, it dominates completely, and no amount of shrinking τ\tau or oˉ\bar{o} changes that; the loop’s own length has become the largest line item, all by itself.

Read this part in the article →

Learn the underlying idea

Σ adds a collection of terms. Π multiplies them. The lower and upper labels tell you which terms belong to the collection.

Open the illustrated sums and products: repeat an operation over an index guide →

See this notation across published equations →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.