相关论文: The Piatetski-Shapiro prime number theorem

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

The subset of quadratic primes {p = an^2 + bn + c : n => 1} generated by an irreducible polynomial f(x) = ax^2 + bx + c over the integers is widely believed to be an unbounded subset of prime numbers. This note provides the details of a…

For $\alpha>1$, set $\beta=1/(\alpha-1)$. We show that, for every $1<\alpha<(\sqrt{21}+4)/5\approx1.717$, the number of pairs $(m,n)$ of positive integers with $d=\lfloor{n^\alpha}\rfloor - \lfloor{m^\alpha}\rfloor$ is equal to…

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

We defined numbers of the form $p\cdot a^2$ as SP numbers (Square-Prime numbers) ($a\neq1$, $p$ prime) in 'Distribution of Square-Prime Numbers' (arXiv:2109.10238). These numbers are listed in the OEIS as A228056. Some examples of SP…

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

We show that for any fixed $\eps>0$, there are numbers $\delta>0$ and $p_0\ge 2$ with the following property: for every prime $p\ge p_0$ and every integer $N$ such that $p^{1/(4\sqrt{e})+\eps}\le N\le p$, the sequence $1,2,...,N$ contains…

In this paper, we proved a theorem that every large enough odd number can be represented as the sum of three almost equal Piatetski-Shapiro primes.