Search Results for ""

Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...

d_n=p_(n+1)-p_n. (1) The first few values are 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, ... (OEIS A001223). Rankin has shown that d_n>(clnnlnlnnlnlnlnlnn)/((lnlnlnn)^2) ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

A prime power is a prime or integer power of a prime. A test for a number n being a prime is implemented in the Wolfram Language as PrimePowerQ[n]. The first few prime powers ...

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

A prime triplet is a prime constellation of the form (p, p+2, p+6), (p, p+4, p+6), etc. Hardy and Wright (1979, p. 5) conjecture, and it seems almost certain to be true, that ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...

Let p_n be the nth prime, then the primorial (which is the analog of the usual factorial for prime numbers) is defined by p_n#=product_(k=1)^np_k. (1) The values of p_n# for ...

A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...

For some authors (e.g., Bourbaki, 1964), the same as principal ideal domain. Most authors, however, do not require the ring to be an integral domain, and define a principal ...