TOPICS
Search

Search Results for ""


121 - 130 of 1361 for Prime ConstellationSearch Results
An arithmetic progression of primes is a set of primes of the form p_1+kd for fixed p_1 and d and consecutive k, i.e., {p_1,p_1+d,p_1+2d,...}. For example, 199, 409, 619, ...
For a prime constellation, the Hardy-Littlewood constant for that constellation is the coefficient of the leading term of the (conjectured) asymptotic estimate of its ...
A number n such that the "LED representation" of n (i.e., the arrangement of horizonal and vertical lines seen on a digital clock or pocket calculator), n upside down, n in a ...
Let omega be the cube root of unity (-1+isqrt(3))/2. Then the Eisenstein primes are Eisenstein integers, i.e., numbers of the form a+bomega for a and b integers, such that ...
In a 1847 talk to the Académie des Sciences in Paris, Gabriel Lamé (1795-1870) claimed to have proven Fermat's last theorem. However, Joseph Liouville immediately pointed out ...
An n-manifold which cannot be "nontrivially" decomposed into other n-manifolds.
A pair of consecutive primes whose digits are rearrangements of each other, first considered by A. Edwards in Aug. 2001. The first few are (1913, 1931), (18379, 18397), ...
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 distribution with probability function P(x)=(x^(alpha-1)(1+x)^(-alpha-beta))/(B(alpha,beta)), where B is a beta function. The mode of a variate distributed as ...
The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...
1 ... 10|11|12|13|14|15|16 ... 137 Previous Next

...