Search Results for ""

An interprime is the average of consecutive (but not necessarily twin) odd primes. The first few terms are 4, 6, 9, 12, 15, 18, 21, 26, 30, 34, ... (OEIS A024675). The first ...

Given a sequence S_i as input to stage i, form sequence S_(i+1) as follows: 1. For k in [1,...,i], write term i+k and then term i-k. 2. Discard the ith term. 3. Write the ...

The largest known prime numbers are Mersenne primes, the largest of these known as of September 2013 bing 2^(57885161)-1, which has a whopping 17425170 decimal digits. As of ...

A field which is complete with respect to a discrete valuation is called a local field if its field of residue classes is finite. The Hasse principle is one of the chief ...

k+2 is prime iff the 14 Diophantine equations in 26 variables wz+h+j-q=0 (1) (gk+2g+k+1)(h+j)+h-z=0 (2) 16(k+1)^3(k+2)(n+1)^2+1-f^2=0 (3) 2n+p+q+z-e=0 (4) ...

The sum c_q(m)=sum_(h^*(q))e^(2piihm/q), (1) where h runs through the residues relatively prime to q, which is important in the representation of numbers by the sums of ...

Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...

Willans' formula is a prime-generating formula due to Willan (1964) that is defined as follows. Let F(j) = |_cos^2[pi((j-1)!+1)/j]_| (1) = {1 for j=1 or j prime; 0 otherwise ...

A Gaussian sum is a sum of the form S(p,q)=sum_(r=0)^(q-1)e^(-piir^2p/q), (1) where p and q are relatively prime integers. The symbol phi is sometimes used instead of S. ...

The constant e^pi that Gelfond's theorem established to be transcendental seems to lack a generally accepted name. As a result, in this work, it will be dubbed Gelfond's ...