Related papers: Small gaps between the Piatetski-Shapiro primes

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

Let p be an odd prime, such that p_n<p/2<p_{n+1}, where p_n is the n-th prime. We study the following question: with what probability does there exist a prime in the interval (p, 2p_{n+1})? After the strong definition of the probability…

In this paper, we prove a quantitative version of the statement that every nonempty finite subset of $\mathbb{N}^+$ is a set of quadratic residues for infinitely many primes of the form $[n^c]$ with $1\leqslant c\leqslant243/205$.…

We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\pi(x)$. As the application of this formula we formulate 7…

We posit that $d_n^2 < 2p_{n+1}$ holds for all $n\geq 1$, where $p_n$ represents the $n$th prime and $d_n$ stands for the $n$th prime gap i.e. $d_n := p_{n+1} - p_n$. Then, the presence of a prime between successive perfect squares, as well…

We show that there exists pairs of consecutive primes less than $x$ whose difference is larger than $t(1+o(1))(\log{x})(\log\log{x})(\log\log\log\log{x})(\log\log\log{x})^{-2}$ for any fixed $t$. Our proof works by incorporating recent…

Suppose that $\alpha_1, \alpha_2,\beta_1, \beta_2 \in\mathbb{R}$. Let $\alpha_1, \alpha_2 > 1$ be irrational and of finite type such that $1, \alpha_1^{-1}, \alpha_2^{-1}$ are linearly independent over $\mathbb{Q}$. Let $c$ be a real number…

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

A positive integer is called an $E_j$-number if it is the product of $j$ distinct primes. We prove that there are infinitely many triples of $E_2$-numbers within a gap size of $32$ and infinitely many triples of $E_3$-numbers within a gap…

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

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…

In this paper we consider the equation $[p^{c}] + [m^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{29}{28}$, then it has a solution in a prime $p$ and an almost prime $m$ with at most $\left[…

The sequence $$ \mathbb{P}^{(c)}=(\lfloor p^c \rfloor)_{p\in \mathbb{P}}\quad (c>0,c\notin \mathbb{N}), $$ is an important subsequence of the well-known Piatetski-Shapiro sequence, where $\mathbb{P}$ is the set of prime numbers and $\lfloor…

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

We prove that for all $n\geq 1$ there exists a number between $n^2$ and $(n+1)^2$ with at most 4 prime factors. This is the first result of this kind that holds for every $n\geq 1$ rather than just sufficiently large $n$. Our approach…

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…

Let $p_n$ is the $n$-th prime. With help of the Cram\'er-like model, we prove that the set of intervals of the form $(2p_n,\enskip2p_{n+1})$ containing at list 3 primes has a positive density with respect to the set of all intervals of such…

In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…