Search Results for ""

To define a recurring digital invariant of order k, compute the sum of the kth powers of the digits of a number n. If this number n^' is equal to the original number n, then ...

An algorithm for making tables of primes. Sequentially write down the integers from 2 to the highest number n you wish to include in the table. Cross out all numbers >2 which ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...

If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.

The set theory symbol (aleph) for the cardinal number of a well-orderable infinite set.

The ordinal number of a value in a list arranged in a specified order (usually decreasing).

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

Let y_n be a complex number for 1<=n<=N and let y_n=0 if n<1 or n>N. Then (Montgomery 2001).

For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...

A group in which any decreasing chain of distinct subgroups terminates after a finite number.