Search Results for ""

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 ...

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

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 ...

A problem in game theory first discussed by A. Tucker. Suppose each of two prisoners A and B, who are not allowed to communicate with each other, is offered to be set free if ...

The probability density function (PDF) P(x) of a continuous distribution is defined as the derivative of the (cumulative) distribution function D(x), D^'(x) = ...

A problem is an exercise whose solution is desired. Mathematical "problems" may therefore range from simple puzzles to examination and contest problems to propositions whose ...