Search Results for ""

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...

A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...

1. Zero is a number. 2. If a is a number, the successor of a is a number. 3. zero is not the successor of a number. 4. Two numbers of which the successors are equal are ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...

Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...

A system is singular if its condition number is infinite and ill-conditioned if it is too large.

The Greek word for 10000.

A number n which is an integer multiple k of the sum of its unitary divisors sigma^*(n) is called a unitary k-multiperfect number. There are no odd unitary multiperfect ...