Search Results for ""

Erdős offered a $3000 prize for a proof of the proposition that "If the sum of reciprocals of a set of integers diverges, then that set contains arbitrarily long arithmetic ...

The converse of Fermat's little theorem is also known as Lehmer's theorem. It states that, if an integer x is prime to m and x^(m-1)=1 (mod m) and there is no integer e<m-1 ...

Let G be a subgroup of the modular group Gamma. Then an open subset R_G of the upper half-plane H is called a fundamental region of G if 1. No two distinct points of R_G are ...

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

Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

The second theorem of Mertens states that the asymptotic form of the harmonic series for the sum of reciprocal primes is given by sum_(p<=x)1/p=lnlnx+B_1+o(1), where p is a ...

In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...

Pickover's sequence gives the starting positions in the decimal expansion of pi (ignoring the leading 3) in which the first n digits of e occur (counting the leading 2). So, ...

The Pippenger product is an unexpected Wallis-like formula for e given by e/2=(2/1)^(1/2)(2/34/3)^(1/4)(4/56/56/78/7)^(1/8)... (1) (OEIS A084148 and A084149; Pippenger 1980). ...