TOPICS
Search

Search Results for ""


1221 - 1230 of 2617 for Prime Generating PolynomialSearch Results
There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...
A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...
The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...
Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.
The Heath-Brown-Moroz constant is defined by C_(Heath-Brown-Moroz) = product_(p)(1-1/p)^7(1+(7p+1)/(p^2)) (1) = 0.00131764115... (2) (OEIS A118228), where the product is ...
For any two nonzero p-adic numbers a and b, the Hilbert symbol is defined as (a,b)={1 if z^2=ax^2+by^2 has a nonzero solution; -1 otherwise. (1) If the p-adic field is not ...
The quadratic class number constant is a constant related to the average behavior of class numbers of real quadratic fields. It is given by Q = product_(p)[1-1/(p^2(p+1))] ...
Sarnak's constant is the constant C_(Sarnak) = product_(p>=3)(1-(p+2)/(p^3)) (1) = 0.7236484022... (2) (OEIS A065476), where the product is over the odd primes.
A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...
The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...
1 ... 120|121|122|123|124|125|126 ... 262 Previous Next

...