TL;DR
This paper derives an asymptotic formula for counting primes within the set of floor functions of x divided by n, for n from 1 to x, providing new insights into prime distribution in these sets.
Contribution
It introduces a novel asymptotic formula for primes in floor function sets, expanding understanding of prime distribution in non-traditional numeric sets.
Findings
Asymptotic formula for prime count in floor sets
Related results on prime distribution in these sets
Enhanced understanding of primes in non-linear sequences
Abstract
Let be a positive integer. We give an asymptotic formula for the number of primes in the set and give some related results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematics and Applications · Limits and Structures in Graph Theory