Related papers: The Piatetski-Shapiro prime number theorem

Let $[\, \cdot\,]$ be the floor function. In this paper, we prove that when $1<c<\frac{16559}{15276}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c_1]+[p^c_2]+[p^c_3]\,,…

We consider the equation $[p_{1}^{c}] + [p_{2}^{c}] + [p_{3}^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each…

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

Let $1 < c < 24/19$. We show that the number of integers $n \le N$ that cannot be written as $[p_1^c] + [p_2^c]$ ($p_1$, $p_2$ primes) is $O(N^{1-\sigma+\varepsilon})$. Here $\sigma$ is a positive function of $c$ (given explicitly) and…

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

We prove that, for any $c_1,c_2,c_3\in(1,41/35)$, every sufficiently large odd number $N$ can be represented as the sum of three primes $N = p_1 + p_2 +p_3$ such that $p_i = \lfloor n_{i}^{c_i}\rfloor$ for some $n_i \in{\mathbb N}$ for each…

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

In this paper, we establish a theorem of Bombieri -- Vinogradov type for exponential sums over Piatetski-Shapiro primes $p= [n^{1/\gamma}]$ with $\frac{865}{886}<\gamma < 1$.

In previous papers the authors established the prime avoidance property of $k$-th powers of prime numbers and of prime numbers within Beatty sequences. In this paper the authors consider $k$-th powers of Piatetski-Shapiro primes.

In this paper, it is proved that, for any $\gamma_1,\gamma_2,\gamma_3,\gamma_4,\gamma_5\in(\frac{28}{29},1)$, every sufficiently large integer $n$ subject to $n\equiv5\pmod{24}$ can be represented as the sum of five squares of primes, i.e.,…

In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.

Vinogradov's three primes theorem indicates that, for every sufficiently large odd integer $N$, the equation $N=p_1+p_2+p_3$ is solvable in prime variables $p_1,p_2,p_3$. In this paper, it is proved that Vinogradov's three primes theorem…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

For every non-integral $\alpha>1$, the sequence of the integer parts of $n^{\alpha}$ $(n=1,2,\ldots)$ is called the Piatetski-Shapiro sequence with exponent $\alpha$, and let $\mathrm{PS}(\alpha)$ denote the set of all those terms. For all…

We show that the $abc$ conjecture of Masser-Oesterl\'{e}-Szpiro for number fields implies that there are infinitely many non-Fibonacci-Wieferich primes. We also provide a new heuristic for the number of such primes beneath a certain value.

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

Let $[\,\cdot\,]$ denote the floor function. In this paper, we show that whenever $\eta$ is real and the constants $\lambda _i$ satisfy some necessary conditions, then for any fixed $\frac{63}{64}<\gamma<1$ and $\theta>0$, there exist…