Before you can read a single line of the parent note, you need to earn every symbol it throws at you. Below, each symbol appears in the order it is built on the previous one. We never use a letter before it has a plain meaning and a picture.
Why a whole number and not a fraction? You can't have half a processor. But in the formulas we still let n grow without bound to ask "what's the absolute ceiling?" — that's the n→∞ notation, read "as n goes to infinity."
Here is the heart of everything. Take the T1 bar and cut it into two coloured pieces.
Now we measure what proportion of the bar is coral. That proportion is the single most important symbol in the topic.
Because the whole bar is 1 (i.e. 100%) and the coral part is f, the mint part must be whatever is left over:
Why write 1−f instead of a new letter like p? Because they always add to 1, giving them two independent letters would hide the fact that they're two halves of the same bar. One letter f tells the whole story.
When n workers share the parallel (mint) work, each does n1 of it, so it finishes n times sooner.
Why does the serial part refuse to shrink? Because "serial" is defined as work that cannot be split. Dividing it by n would contradict its own definition. This stubborn coral floor is the entire reason Amdahl's Law has a ceiling.
We finally compare the two bars. "How many times faster?" is a ratio.
Why a ratio and not a difference like T1−Tn? A difference is in seconds and depends on the size of the job. A ratio is a pure number — "2.5×" means the same thing whether the job took milliseconds or hours. That portability is why performance is always quoted as speedup.
Why do we bother with infinity when no computer has infinite cores? Because it reveals the hard ceiling. If f=0.1, no amount of hardware ever beats 10×. Knowing the ceiling stops you wasting money on cores that can't help.
Gustafson's formula S(n)=n−f(n−1) uses the same symbols but in a new shape. Every piece is already defined:
n — processors (Section 2),
f — serial fraction (Section 3),
n−1 — read "one fewer than n"; it appears because Gustafson compares the parallel work at scale (n times bigger) against a single worker doing all of it.
Recall Why does Gustafson give a bigger number than Amdahl?
Because Amdahl keeps the same mint slice and shrinks its runtime, while Gustafson lets the mint slice grow with n. Same symbols, different assumption about whether the problem grows.