Estimating the Number of Primes in Unusual Domains
ACM SIGACT News · 31.03.2026 · 57 (1) · 29-40
DOI: 10.1145/3802807.3802811 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM SIGACT News, online erschienen am 31.03.2026. Verfasst von Jonathan Cai und 4 weiteren Autor:innen. Die Arbeit nennt 3 Literaturangaben.
Abstract (Originalsprache)
The Prime Number Theorem states that the number of primes in 1, . . . , x, denoted π(x), is approximately x/ln(x) . In this paper, we investigate the distribution of primes for domains other than N. First we look at A d = x: x ≡ 1 (mod d). We give a heuristic argument to form a conjecture on the number of congruence monoid primes in Ad that are ≤ x. We then provide empirical evidence that indicates our conjecture is close but may need some correction. Second, we do similar calculations for the Gaussian Integers. Third, we discuss the difficulty of these types of questions for quadratic extensions of Z.
Zitieren
APA
Cai, J., Diehl, R., Sinha, R., Gasarch, W., & Kim, I. (2026). Estimating the Number of Primes in Unusual Domains. ACM SIGACT News, 57(1), 29-40. https://doi.org/10.1145/3802807.3802811
Vancouver
Cai J, Diehl R, Sinha R, Gasarch W, Kim I. Estimating the Number of Primes in Unusual Domains. ACM SIGACT News. 2026;57(1):29-40. doi:10.1145/3802807.3802811
BibTeX
@article{Cai2026,
author = {Cai, Jonathan and Diehl, Ryan and Sinha, Rohan and Gasarch, William and Kim, Ian},
title = {Estimating the Number of Primes in Unusual Domains},
journal = {ACM SIGACT News},
year = {2026},
volume = {57},
number = {1},
pages = {29--40},
doi = {10.1145/3802807.3802811}
}
EUVIMED