Related papers: Sums of many primes
In this paper, under the RH, we give a new representation of $N(T)$ in term of sum of the logarithms of the powers of prime numbers and compute the difference between the new representation and Guinand representation.
Fix an integer $g \neq -1$ that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which $g$ is a primitive root. Forty years later, Hooley showed that Artin's conjecture follows from the…
In this paper we will propose a strategy to prove Goldbach's conjecture: every even integer greater than 2 can be written as the sum of two primes.
When k > 1 and s is sufficiently large in terms of k, we derive an explicit multi-term asymptotic expansion for the number of representations of a large natural number as the sum of s positive integral k-th powers.
Let HN denote the problem of determining whether a system of multivariate polynomials with integer coefficients has a complex root. It has long been known that HN in P implies P=NP and, thanks to recent work of Koiran, it is now known that…
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
Fujii obtained a formula for the average number of Goldbach representations with lower order terms expressed as a sum over the zeros of the Riemann zeta-function and a smaller error term. This assumed the Riemann Hypothesis. We obtain an…
In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…
We compute all primes up to $6.25\times 10^{28}$ of the form $m^2+1$. Calculations using this list verify, up to our bound, a less famous conjecture of Goldbach. We introduce `Goldbach champions' as part of the verification process and…
For a fixed rational number g and integers a and d the sets N_g(a,d), respectively R_g(a,d), of primes p for which the order, respectively the index of g(mod p) is congruent to a(mod d), are considered. Under the Generalized Riemann…
Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…
For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…
We study the number of primes with a given primitive root and in an arithmetic progression under the assumption of a suitable form of the generalized Riemann Hypothesis. Previous work of Lenstra, Moree and Stevenhagen has given asymptotics…
We prove that every sufficiently large odd integer can be expressed as a sum of one square and fourteen fifth powers, all of primes. In addition, we establish that every sufficiently large even integer can be written as a sum of one square,…
Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…
We derive an asymptotic formula for the sum $$ H = \sum_{0<\gamma_k\leqslant T,\, 1\leqslant k\leqslant m}h(a_1\gamma_1+a_2\gamma_2+\cdots + a_m\gamma_m), $$ where $a_1, a_2, \ldots, a_m$ are integers whose sum equals zero, $\gamma_1,…
On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.
Recently, we have established the generalized Li's criterion equivalent to the Riemann hypothesis, viz. demonstrated that the sums over all non-trivial Riemann function zeroes k_n,a=Sum_rho(1-(1-((rho-a)/(rho+a-1))^n) for any real a not…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…