Search Results for ""

A very large number defined in terms of circle notation by Steinhaus (1983) as .

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

A number theoretic function is a function whose domain is the set of positive integers.

Any prime number other than 2 (which is the unique even prime). Humorously, 2 is therefore the "oddest" prime.

The number of outward directed graph edges from a given graph vertex in a directed graph.

The Fermat number F_n is prime iff 3^(2^(2^n-1))=-1 (mod F_n).

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

The number of digits used to perform a given computation. The concepts of accuracy and precision are both closely related and often confused. While the accuracy of a number x ...

alpha is called a predecessor if there is no ordinal number beta such that beta+1=alpha.