Related papers: The Least Prime Number in a Beatty Sequence

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…

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new…

Let $k \ge 2$ and $\alpha_1, \beta_1, ..., \alpha_k, \beta_k$ be reals such that the $\alpha_i$'s are irrational and greater than 1. Suppose further that some ratio $\alpha_i/\alpha_j$ is irrational. We study the representations of an…

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>1$ be irrational and of finite type, $\beta\in\mathbb{R}$. In this paper, it is proved that for $R\geqslant13$ and any fixed $c\in(1,c_R)$, there exist infinitely many primes in the intersection of Beatty sequence…

The problem of the least prime number in an arithmetic progression is one of the most important topics in Number Theory. In [11], we are the first to study the relations between this problem and Goldbach's conjecture. In this paper, we…

In this paper we find an identity that gives a representation for the logarithm of any two irrational numbers $a, b >1$ in terms of a series whose terms are ratios of elements from the Beatty Sequences generated by these two numbers. We…

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

We study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is $1$ or a prime. In this paper we show that this claim is connected to a strong version…

An asymptotic formula is given for the number of y-smooth numbers up to x in a Beatty sequence corresponding to an irrational number of finite type.

Let $\alpha,\beta$ be real numbers such that $\alpha>1$ is irrational and of finite type, and let $c$ be a real number in the range $1<c<\frac{14}{13}$. In this paper, it is shown that there are infinitely many Piatetski-Shapiro primes $p =…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.

We study the problem of representing integers as sums of prime numbers from a fixed Beatty sequence $B_{\alpha,\beta}$, where $\alpha>1$ is irrational and of finite type.

We investigate, using the weighted linear sieve, the distribution of almost-primes among the residue classes (mod p) that generate the multiplicative group of reduced residue classes. We are concerned with finding an upper bound for the…

Fix irrational numbers $\alpha,\hat\alpha>1$ of finite type and real numbers $\beta,\hat\beta\ge 0$, and let $B$ and $\hat B$ be the Beatty sequences $$ B:=(\lfloor\alpha m+\beta\rfloor)_{m\ge 1}\quad\text{and}\quad\hat…

The existence of greatest lower bounds in the imbalance order of path-length sequences of binary trees is seen to be a consequence of a joint monotonicity property of the greater and lower expension operations. Path length sequences that…

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

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.