In an n-dimensional Euclidean space any point can be specified by n real numbers.

Consider performing insertion sort on n numbers on a random access machine.

You can represent any point on an n-dimensional space by a set of n numbers.

If other threads enter the lock, they must wait until the initial thread that passed through completes n number of times.

Formally, let be a sequence of n distinct numbers.

Construct a vector of n numbers drawn according a standard Gaussian distribution.

The following procedure outlines exactly how to get a chosen n number of balls remaining in the vase.

Say we want to find the kth largest of a group of n numbers.

The nth tetrahedral number is the sum of the first n triangular numbers.

In general, the solution will be n complex numbers where n is the order of the characteristic polynomial.