arXiv Analytics

Sign in

arXiv:2404.14765 [math.NT]AbstractReferencesReviewsResources

On the order of magnitude of certain integer sequences

Michael Hellus, Anton Rechenauer, Rolf Waldi

Published 2024-04-23Version 1

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$ itself: By Harald Helfgott (arXiv:1312.7748 [math.NT]), every odd integer $N$ greater than five can be written as the sum of three prime numbers. There is numerical evidence suggesting that the summands of $N$ always can be chosen between $\frac N6$ and $\frac N2$. This would imply that $u$ is less than $6p$.

Comments: 11 pages, 1 figure
Categories: math.NT
Subjects: 11D07, 20M14
Related articles: Most relevant | Search more
arXiv:2212.09470 [math.NT] (Published 2022-12-13)
Automated Search for Conjectures on Mathematical Constants using Analysis of Integer Sequences
arXiv:math/0607588 [math.NT] (Published 2006-07-24)
A Small World Network of Prime Numbers
arXiv:math/0010286 [math.NT] (Published 2000-10-29)
Comparison of algorithms to calculate quadratic irregularity of prime numbers