Search Results for ""

A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...

The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...

The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...

A nonnegative matrix is a real or integer matrix (a)_(ij) for which each matrix element is a nonnegative number, i.e., a_(ij)>=0 for all i, j. Nonnegative matrices are ...

An odd alternating permutation number, more commonly called an Euler number or secant number.

100=10^2. Madachy (1979) gives a number of algebraic equations using the digits 1 to 9 which evaluate to 100, such as (7-5)^2+96+8-4-3-1 = 100 (1) 3^2+91+7+8-6-5-4 = 100 (2) ...

kappa(d)={(2lneta(d))/(sqrt(d)) for d>0; (2pi)/(w(d)sqrt(|d|)) for d<0, (1) where eta(d) is the fundamental unit and w(d) is the number of substitutions which leave the ...

Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...

Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...

A short set of data that proves the primality of a number. A certificate can, in general, be checked much more quickly than the time required to generate the certificate. ...