Primes of the form $ ax+by $
Frontiers in Combinatorics and Number Theory · 2026 · 1 · 16-25
DOI: 10.3934/fcnt.2026002 ↗Kurz gefasst
Fachartikel in der Zeitschrift Frontiers in Combinatorics and Number Theory, 2026. Verfasst von Yong-Gao Chen und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
For two coprime positive integers $a,b$, let $T(a,b)=\{ ax+by : x,y\in \mathbb{Z}_{\ge 0} \} $ and let $s(a,b)=ab-a-b$. It is well known that all integers which are greater than $s(a,b)$ are in $T(a,b)$. Let $\pi (a, b)$ be the number of primes in $T(a,b)$ which are less than or equal to $s(a,b)$. It is easy to see that $\pi (2, 3)=0$ and $\pi (2, b)=1$ for all odd integers $b\ge 5$. In this paper, we prove that if $b>a\ge 3$ with $\gcd (a, b)=1$, then $\pi (a, b)>0.005 s(a,b)/\log s(a,b)$. We conjecture that $\frac{13}{66}\pi (s(a,b))\le \pi (a, b)\le \frac 12\pi (s(a,b))$ for all $b>a\ge 3$ with $\gcd (a, b)=1$.
Zitieren
APA
Chen, Y., & Zhu, H. (2026). Primes of the form $ ax+by $. Frontiers in Combinatorics and Number Theory, 1(0), 16-25. https://doi.org/10.3934/fcnt.2026002
Vancouver
Chen Y, Zhu H. Primes of the form $ ax+by $. Frontiers in Combinatorics and Number Theory. 2026;1(0):16-25. doi:10.3934/fcnt.2026002
BibTeX
@article{Chen2026,
author = {Chen, Yong-Gao and Zhu, Hui},
title = {Primes of the form $ ax+by $},
journal = {Frontiers in Combinatorics and Number Theory},
year = {2026},
volume = {1},
number = {0},
pages = {16--25},
doi = {10.3934/fcnt.2026002}
}
EUVIMED