Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

Consecutive primes and Beatty sequences (1612.01468v1)

Published 5 Dec 2016 in math.NT

Abstract: 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 B:=(\lfloor\hat\alpha m+\hat\beta\rfloor){m\ge 1}. $$ In this note, we study the distribution of pairs $(p,p\sharp)$ of consecutive primes for which $p\in B$ and $p\sharp\in\hat B$. Under a strong (but widely accepted) form of the Hardy-Littlewood conjectures, we show that $$ \big|{p\le x:p\in B\text{ and }p\sharp\in\hat B}\big|=(\alpha\hat\alpha){-1}\pi(x)+O\big(x(\log x){-3/2+\epsilon}\big), $$ where $\pi(x)$ is the prime counting function.

Summary

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