Sums of Consecutive Prime Squares
Janyarak Tongsomporn, Saeree Wananiyakul, J\"orn Steuding
TL;DR
This paper establishes explicit bounds on how many sums of consecutive prime squares are below a certain size, advancing understanding of prime square sums in number theory.
Contribution
It provides new explicit bounds for the count of sums of consecutive prime squares under a given magnitude, a novel quantitative result.
Findings
Derived explicit bounds for prime square sums
Quantified the number of such sums below thresholds
Enhanced previous theoretical estimates
Abstract
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
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
Topicsgraph theory and CDMA systems · Graph Labeling and Dimension Problems · Analytic Number Theory Research