Search arXivSearch

arXiv · 2504.20289

Primes represented by shifted quadratic forms: on primitivity and congruence classes

Abstract

We prove lower bounds of the form $\gg N/(\log N)^{3/2}$ for the number of primes up to $N$ primitively represented by a shifted positive definite integral binary quadratic form, and under the additional condition that primes are from an arithmetic progression. This extends the sieve methods of Iwaniec, who showed such lower bounds without the primitivity and congruence conditions. Imposing primitivity adds some subtleties to the local criteria for representation of a shifted prime: for example, some shifted quadratic forms of discriminant $5 \pmod{8}$ do not primitively represent infinitely many primes. We also provide a careful list of the local conditions under which a genus of an integral binary quadratic form represents an integer, verified by computer, and correcting some minor errors in previous statements. The motivation for this work is as a tool for the study of prime components in Apollonian circle packings [FFH+24]

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elena Fuchs, Catherine Hsu, James Rickards, Damaris Schindler, Katherine E. Stange. 2025-04-28. Primes represented by shifted quadratic forms: on primitivity and congruence classes. https://arxiv.org/abs/2504.20289

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT