Search Results for ""

The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

A shorthand name for a series with the variable k taken to a negative exponent, e.g., sum_(k=1)^(infty)k^(-p), where p>1. p-series are given in closed form by the Riemann ...

There are two related conjectures, each called the twin prime conjecture. The first version states that there are an infinite number of pairs of twin primes (Guy 1994, p. ...

Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...

Montgomery's pair correlation conjecture, published in 1973, asserts that the two-point correlation function R_2(r) for the zeros of the Riemann zeta function zeta(z) on the ...

The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...

Let P be a prime ideal in D_m not containing m. Then (Phi(P))=P^(sumtsigma_t^(-1)), where the sum is over all 1<=t<m which are relatively prime to m. Here D_m is the ring of ...

Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. B. Haible and T. Papanikolaou computed zeta(3) to 1000000 ...

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