Related papers: Discrepancies in the distribution of Gaussian prim…

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

Dedekind sums have applications in quite a number of fields of mathematics. Therefore, their distribution has found considerable interest. This article gives a survey of several aspects of the distribution of these sums. In particular, it…

Let $P^{\left(\frac 12\right)}(n)$ denote the middle prime factor of $n$ (taking into account multiplicity). More generally, one can consider, for any $\alpha \in (0,1)$, the $\alpha$-positioned prime factor of $n$, $P^{(\alpha)}(n)$. It…

It is well known that the classical Gauss sum, normalized by the square-root number of terms, takes only finitely many values. If one restricts the range of summation to a subinterval, a much richer structure emerges. We prove a limit law…

We describe positive generalized functionals in Gaussian Analysis. We focus on distribution spaces larger than the space of Hida Distributions. It is shown that a positive distribution is represented by a measure with specific growth of its…

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we…

This note highlights an interesting connection between Euler sums of even weight and prime numbers.

We study the Goldbach problem for primes represented by the polynomial $x^2+y^2+1$. The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even…

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…

A multiple Gauss sum is a complete multiple exponential sum twisted by Dirichlet characters. We prove a new bound for multiple Gauss sums and, as an application, improve previous results in the Birch--Goldbach problem. Let $F_1, \ldots, F_R…

Let $H$ be a Hardy field (a field consisting of germs of real-valued functions at infinity that is closed under differentiation) and let $f \in H$ be a subpolynomial function. Let $\mathcal{P} = \{2, 3, 5, 7, \dots \}$ be the (naturally…

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

H\'ethelyi and K\"ulshammer showed that the number of conjugacy classes $k(G)$ of any solvable finite group $G$ whose order is divisible by the square of a prime $p$ is at least $(49p+1)/60$. Here an asymptotic generalization of this result…

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.

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

We demonstrate the existence of a congruence class bias in the distribution of supersingular primes on average for elliptic curves over $\Q$. For example, we show that on average there are twice as many supersingular primes congruent to 2…

Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…

We prove that every sufficiently large integer $n$ can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every $n > 24$ and prove two results to support this claim. First,…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…

Since the mathematicians of ancient Greece until Fermat, since Gauss until today; the way how the primes along the numerical straight line are distributed has become perhaps the most difficult math problem; many people believe that their…