Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Beatty primes from fractional powers of almost-primes (2109.00536v1)

Published 1 Sep 2021 in math.NT

Abstract: 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 $\mathcal{B}_{\alpha,\beta}$ and $\lfloor nc\rfloor$, where $c_R$ is an explicit constant depending on $R$ herein, $n$ is a natural number with at most $R$ prime factors, counted with multiplicity.

Summary

We haven't generated a summary for this paper yet.