Search Results for ""

Let alpha and beta be any ordinal numbers, then ordinal exponentiation is defined so that if beta=0 then alpha^beta=1. If beta is not a limit ordinal, then choose gamma such ...

A set of two numbers or objects linked in some way is said to be a pair. The pair a and b is usually denoted (a, b), and is generally considered to be ordered, making it a ...

A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...

A planar connected graph is a graph which is both planar and connected. The numbers of planar connected graphs with n=1, 2, ... nodes are 1, 1, 2, 6, 20, 99, 646, 5974, ...

The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A random variate is a variable generated from uniformly distributed pseudorandom numbers. Depending on how they are generated, a random variate can be uniformly or ...

For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...

The first Strehl identity is the binomial sum identity sum_(k=0)^n(n; k)^3=sum_(k=0)^n(n; k)^2(2k; n), (Strehl 1993, 1994; Koepf 1998, p. 55), which are the so-called Franel ...