← All parts of this equation

Equation 2 · Part 3 · Measuring AI Agent Architectures: Evidence, Benchmarks, and Uncertainty

Symbol k

pat least one of k=1−(1−p)k,pall k succeed=pk.p_{\text{at least one of } k} = 1 - (1-p)^k, \qquad p_{\text{all } k \text{ succeed}} = p^k.
kk

What this part means

k is part of the quantity the equation computes from the expression on the right.

Its job in the formula

k is part of the quantity the equation computes from the expression on the right.

The passage around this formula

The distinction matters because the two metrics behave very differently even under the most favourable possible assumption — that trials are statistically independent. Write p for the probability that a single trial on a given task succeeds. Under independence, pat least one of k=1−(1−p)k,pall k succeed=pkp_{\text{at least one of } k} = 1 - (1-p)^k, \qquad p_{\text{all } k \text{ succeed}} = p^k. The first quantity rises quickly toward one as k grows, which is the intuitive but misleading sense in which “just try again” seems to fix unreliability. The second quantity falls quickly toward zero, and it is the quantity that matters if a task must be completed correctly on a specific occasion rather than merely being solvable in principle across several attempts.

Read this part in the article →

Learn the underlying idea

A variable is a named place for a value. Its letter is a local label: x can mean position in one formula and a data point in another.

Open the illustrated variables: a letter stands for a value 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.