Related papers: Average orders of Goldbach Estimates in Arithmetic…
Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…
Goldbach conjecture is one of the most famous open mathematical problems. It states that every even number, bigger than two, can be presented as a sum of 2 prime numbers. % In this work we present a deep learning based model that predicts…
After certain subsets of Natural numbers called Range and Row are defined, we assume (1) there is a function that can produce prime numbers and (2) each even number greater than 2, like A, can be represented as the sum of n prime numbers.…
The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…
We prove new mean value theorems for primes in arithmetic progressions to moduli larger than $x^{1/2}$. Our main result shows that the primes are equidistributed for a fixed residue class over all moduli of size $x^{1/2+\delta}$ with a…
Goldbach`s Conjecture, "every even number greater than 2 can be expressed as the sum of two primes" is renamed Goldbach`s Rule for it can not be otherwise. The conjecture is proven by showing that the existence of prime pairs adding to any…
We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{3}+p_{2}^{3}+p_{3}^{3}+p_{4}^{3}$, where $p_1,p_2,p_3,p_4$ are prime numbers, holds in intervals shorter than the the ones…
A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.
An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound…
We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime square and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in…
In a paper in the American Mathematical Monthly, the corresponding author asks for an asymptotic of a gcd-sum function \begin{align}\sum_{ab\leq N}\tau(\gcd(a,b))\label{eqn:taugcdsum}\end{align} We extensively study generalizations of the…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
We give an algorithm to compute the $\omega$-primality of finitely generated atomic monoids. Asymptotic $\w$-primality is also studied and a formula to obtain it in finitely generated quasi-Archimedean monoids is proven. The formulation is…
We show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…
Using the theory of metaplectic forms,we study the asymptotic behavior of cubic exponential sums over the ring of Eisenstein integers. In the first part of the paper, some non-trivial estimates on average over arithmetic progressions are…
In this paper we obtain asymptotic expansion for the geometric mean of the values of positive strongly multiplicative function $f$ satisfying $f(p)=\alpha(d)\,p^d+O(p^{d-\delta})$ for any prime $p$ with $d$ real and $\alpha(d),\delta>0$.
The Landau-Selberg-Delange (LSD) method gives an asymptotic formula for the partial sums of a multiplicative function $f$ whose prime values are $\alpha$ on average. In the literature, the average is usually taken to be $\alpha$ with a very…
Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…
Asymptotic expressions for Clebsch-Gordan coefficients are derived from an exact integral representation. Both the classically allowed and forbidden regions are analyzed. Higher-order approximations are calculated. These give, for example,…