When studying predicate logic, students must learn to recognize well-formed formulae before attempting proofs.

In propositional logic, a well-formed formula can be evaluated as true or false depending on the assignment of truth values.

When teaching advanced undergraduates, I often illustrate Euler's continued fraction formula with a simple example to show how a finite sum of products can be written as a continued fraction.

When computing the nth derivative of a composite function, Faà di Bruno's formula provides a systematic way to organize the terms.

Researchers implemented the Bailey-Borwein-Plouffe formula to extract the millionth hexadecimal digit of pi without computing all the preceding digits.