Related papers: On almost primes in Piatetski-Shapiro sequences

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we establish a theorem of Bombieri-Vinogradov type for the Piatetski-Shapiro primes $p=[n^{1/\gamma}]$ with…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for $\alpha\in\mathbb{R}\backslash\mathbb{Q},\,\beta\in\mathbb{R}$ and $0<\theta<10/1561$, there…

The Piatetski-Shapiro sequences are of the form $\mathcal{N}_{c} := (\lfloor n^{c} \rfloor)_{n=1}^\infty$, where $\lfloor \cdot \rfloor$ is the integer part. It is expected that there are infinitely many primes in a Piatetski-Shapiro…

We establish discorrelation estimates between the Piatetski-Shapiro prime set \[ \mathcal{P}_{\gamma} := \{p \text{ is prime and } p = \lfloor n^{1/\gamma} \rfloor \text{ for some } n \in \mathbb{N}\} \] and arbitrary nilsequences when…

In this paper, we prove that for any fixed $205/243<\gamma\leqslant1$, every sufficiently large $N$ satisfying $N\equiv 5 \pmod {24}$ can be represented as five squares of primes with one prime in $\mathcal{P}_\gamma$, which improves the…

Suppose that $\alpha,\beta\in\mathbb{R}$. Let $\alpha\geqslant1$ and $c$ be a real number in the range $1<c< 12/11$. In this paper, it is proved that there exist infinitely many primes in the generalized Piatetski--Shapiro sequence, which…

Let $m\geq 3$. Suppose that $$ 1-2^{-2^{m^24^m}}<\gamma<1. $$ Then the set $$ \{p\text{ prime}:\, p=[n^{\frac1\gamma}]\text{ for some }n\in{\mathbb N}\} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.

We show that there are infinitely many primes $p$ such that not only does $p + 2$ have at most two prime factors, but $p + 6$ also has a bounded number of prime divisors. This refines the well known result of Chen.

Let $\lfloor t\rfloor$ denote the integer part of $t\in\mathbb{R}$ and $\|x\|$ the distance from $x$ to the nearest integer. Suppose that $1/2<\gamma_2<\gamma_1<1$ are two fixed constants. In this paper, it is proved that, whenever $\alpha$…

Let $\pi(x;\gamma_1,\gamma_2)$ denote the number of primes $p$ with $p\leqslant x$ and $p=\lfloor n^{1/\gamma_1}_1\rfloor=\lfloor n^{1/\gamma_2}_2\rfloor$, where $\lfloor t\rfloor$ denotes the integer part of $t\in\mathbb{R}$ and…

We prove that for every irrational number $\alpha$, real number $\beta$, real number $c$ satisfying $1<c<9/8$ and positive real number $\theta$ satisfying $\theta<(9/c-8)/10$, there exist infinitely many primes of the form…

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.,…

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

We prove that there are infinitely many solutions of $$ |\lambda_0+\lambda_1p+\lambda_2P_r|<p^{-\tau}, $$ where $r=3,$ $\tau=\frac1{118}$, and $\lambda_0$ is an arbitrary real number and $\lambda_1,\lambda_2\in\BR$ with $\lambda_2\neq0$ and…

Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).

Let $\gamma<1<c$ and $19(c-1)+171(1-\gamma)<9$. In this paper, we establish an asymptotic formula for exponential sums over Piatetski-Shapiro primes $p=[n^{1/\gamma}]$ in arithmetic progressions.

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

In this paper, it is proved that, for $\gamma\in(\frac{317}{320},1)$, every sufficiently large odd integer can be written as the sum of nine cubes of primes, each of which is of the form $[n^{1/\gamma}]$. This result constitutes an…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…