Related papers: The Average Number of Goldbach Representations
We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
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…
In this paper, we use the former of the authors developed theory of \emph{circles of partition} to investigate possibilities to prove the binary Goldbach and Lemoine conjectures. We state the \emph{squeeze principle} and its consequences…
We give asymptotic formulas for the number of balanced words whose slope $\alpha$ and intercept $\rho$ lie in a prescribed rectangle. They are related to uniform distribution of Farey fractions and Riemann Hypothesis. In the general case,…
We introduce a sieve for counting twin primes up to a given range. Our method depends on a parameter ${\lambda}_x$ and the estimation of the number of twin primes obtained as a result, is called a fundamental structure of the distribution…
In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…
Let $$\gamma^*:=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:,\ \gamma^*<\frac{1}{c_0}\leq 1\:.$$ Let $\gamma^*<\gamma_0\leq 1$, $c_0=1/\gamma_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$. In [23] we proved…
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…
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…
In this paper, we give a short elementary proof of the well known Euler's recurrence formula for the Riemann zeta function at positive even integers and integral representations of the Riemann zeta function at positive integers and at…
The ternary Goldbach conjecture states that every odd number $n\geq 7$ is the sum of three primes. The estimation of the Fourier series $\sum_{p\leq x} e(\alpha p)$ and related sums has been central to the study of the problem since Hardy…
We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…
For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…
The Strong Goldbach conjecture dates back to 1742. It states that every even integer greater than four can be written as the sum of two prime numbers. Since then, no one has been able to prove the conjecture. The only best known result so…
With an artificial (p', n')-system it has been proved that even numbers > (p(x))^2 are the sum of two p > p(x).
The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…
In this paper we extend and improve all the previous results known in literature about weighted average, with Ces\`aro weight, of representations of an integer as sum of a positive arbitrary number of prime powers and a non-negative…
Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…
In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…