Explicit formula for the average of Goldbach and prime tuples representations

Abstract

Let (n) be the Von Mangoldt function, let \[ rG(n)= m1+m2=nΣm1,m2≤ n(m1)(m2), \] \[ rPT(N,h)=Σn=0N(n)(n+h),\,h∈N \] be the counting function of the Goldbach numbers and the counting function of the prime tuples, respectively. Let N>2 be an integer. We will find the explicit formulae for the averages of rG(n) and rPT(N,h) in terms of elementary functions, the incomplete Beta function Bz(a,b), series over that, with or without subscript, runs over the non-trivial zeros of the Riemann Zeta function and the Dilogarithm function. We will also prove the explicit formulae in an asymptotic form and a truncated formula for the average of rG(n). Some observation about these formulae and the average with Ces\`aro weight \[ 1(k+1)Σn≤ NrG(n)(N-n)k,\,k>0 \] are included.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…