Related papers: On Primes Represented by Cubic Polynomials

I give some claims on primorial prime numbers for interested readers in number theory.

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

In this paper we prove an incidence bound for points and cubic curves over prime fields. The methods generalise those used by Mohammadi, Pham, and Warren (2021).

We prove the norm convergence of multiple ergodic averages along cubes for several commuting transformations, and derive corresponding combinatorial results. The method we use relies primarily on the "magic extension" established recently…

The aim of this paper is to prove Cotlar's ergodic theorem modeled on the set of primes.

We give new characterizations of the Midy's property and using these results we obtain a new proof of a special case of the Dirichlet's theorem about primes in arithmetic progression.

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

We prove a new mean value theorem on the distribution of primes in two simultaneous arithmetic progressions. Our approach builds on previous arguments of Bombieri, Fouvry, Friedlander, and Iwaniec appealing to spectral theory of Kloosterman…

This is an article for a general mathematical audience on the author's work, joint with Terence Tao, establishing that there are arbitrarily long arithmetic progressions of primes. It is based on several one hour lectures, chiefly given at…

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for…

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

We prove a new mean-value theorem for Dirichlet polynomials with coefficients given by the von Mangoldt function. We then use our theorem to derive new estimates for certain exponential sums over primes. The latter have applications to…

Let $K$ be a finite Galois extension of $\mathbb{Q}$. We count primes in short intervals represented by the norm of a prime ideal of $K$ satisfying a small sector condition determined by Hecke characters. We also show that such primes are…

We prove $q$-variation estimates, $q>2$, on $\ell^{p}$ spaces for averages along primes (with $1<p<\infty$) and polynomials (with $\big| \frac1p - \frac12 \big| < \frac{1}{2(d+1)}$, where $d$ is the degree of the polynomial). This improves…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer $b\leq 246$ such that there are infinitely many primes $p$ such that $p+b$ is also prime. Let $P_1,...,P_t\in \mathbb{Z}[y]$ with…

We study the average value of the divisor function $\tau(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$.…

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…