Search Results for ""

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A class number formula is a finite series giving exactly the class number of a ring. For a ring of quadratic integers, the class number is denoted h(d), where d is the ...

A test which always identifies prime numbers correctly, but may incorrectly identify a composite number as a prime.

Maximize the number of cookies you can cut from a given expanse of dough (Hoffman 1998, p. 173).

One of the Plücker characteristics, defined by p=1/2(n-1)(n-2)-(delta+kappa)=1/2(m-1)(m-2)-(tau+iota), where m is the class, n the order, delta the number of nodes, kappa the ...

z^p-y^p=(z-y)(z-zetay)...(z-zeta^(p-1)y), where zeta=e^(2pii/p) (a de Moivre number) and p is a prime.

A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.

A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...

The first quadratic nonresidue mod p of a number is always less than 3(lnp)^2/2 (Wedeniwski 2001).