Related papers: The Green-Tao theorem: an exposition

We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

We prove that if $A$ is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then $A$ must contain a $3$-term arithmetic progression. This is accomplished by combining the transference principle with a density…

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…

We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

In this paper, we establish some theorems on the distribution of primes in higher-order progressions on average.

We prove analogues of the theorem of Green and Tao on linear constellations in primes, in which the primes under consideration are restricted by certain arithmetic conditions. Our first main result is conditional upon Hooley's Riemann…

In 1973, J.-R. Chen showed that every large even integer is a sum of a prime and a product of at most two primes. In this paper, the author indicates and fixes the issues in a simplified proof of this result given by Pan et al.

We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…

For $j=1,2$, let $f_j(z) = \sum_{n=1}^{\infty} a_{j}(n) e^{2\pi i nz}$ be a holomorphic, non-CM cuspidal newform of even weight $k_j \ge 2$ with trivial nebentypus. For each prime $p$, let $\theta_{j}(p)\in[0,\pi]$ be the angle such that…

We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.

Schatunowsky's 1893 theorem, that 30 is the largest number all of whose totatives are primes, has been recently generalized by Kaneko and Nakai. In its generalized form, it states the finiteness of the set of all positive numbers $n$,…

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.

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

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…

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.