Search Results for ""

A friend of a number n is another number m such that (m,n) is a friendly pair.

Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...

Let V be a real symmetric matrix of large order N having random elements v_(ij) that for i<=j are independently distributed with equal densities, equal second moments m^2, ...

The prime number theorem shows that the nth prime number p_n has the asymptotic value p_n∼nlnn (1) as n->infty (Havil 2003, p. 182). Rosser's theorem makes this a rigorous ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...

Let f(z) be an analytic function in an angular domain W:|argz|<alphapi/2. Suppose there is a constant M such that for each epsilon>0, each finite boundary point has a ...

A condition which, if true, guarantees that a result is also true. (However, the result may also be true if the condition is not met.) If a condition is both necessary and ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

The number 10 (ten) is the basis for the decimal system of notation. In this system, each "decimal place" consists of a digit 0-9 arranged such that each digit is multiplied ...