Related papers: Primes in tuples and Romanoff's theorem

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

We establish lower bounds for the $2k$-th moment of central values of the family of primitive Dirichlet $L$-functions to a fixed prime modulus for all real $k<0$, assuming the non-vanishing of these $L$-values.

In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

We prove that the integral of scalar curvature over a Riemannian manifold is uniformly bounded below in terms of its dimension, upper bounds on sectional curvature and volume, and a lower bound on injectivity radius. This is an analogue of…

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…

We show that a positive proportion of all gaps between consecutive primes are small gaps. We provide several quantitative results, some unconditional and some conditional, in this flavour.

We prove results pertaining to strong approximation for Markoff triples in the case of prime moduli.

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

Under the Riemann hypothesis, we use the distribution of zeros of the zeta function to get a lower bound for the maximum of some derivative of Hardy's function.

For a prime number $p$ and a sequence of integers $a_0,\dots,a_k\in \{0,1,\dots,p\}$, let $s(a_0,\dots,a_k)$ be the minimum number of $(k+1)$-tuples $(x_0,\dots,x_k)\in A_0\times\dots\times A_k$ with $x_0=x_1+\dots + x_k$, over subsets…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

The article focuses on the problems of prime gaps and zero spacings. Possible solutions of several related problems such as the greatest lower bound, the least upper bound of the zero spacings, and the least upper bound of the prime gaps…

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

The aim of this paper is to prove upper and lower $L^p$ estimates, $1<p<\infty$, for Littlewood-Paley square functions in the rational Dunkl setting.