Assume is an interval and that for every natural number k, is an increasing function.

Here we just consider objects made up from a finite number k of points in n dimensions.

For every natural number k, there are infinitely many prime gaps of size 2k.

Pick a random number k between one and the number of unstruck numbers remaining (inclusive).

More generally, the exterior product of any number k of vectors can be defined and is sometimes called a k-blade.

Since it is known that for a number K, at least bits are required to represent it in binary.

A related problem is to solve reachability queries with some number k of node failures.

The number k is called the order of the haven.

For each natural number k there is a sort of variable that ranges over all k-ary relations on the individuals.

The number k is then the height of the vertex above the x-axis.