Perfect squares have at most five divisors close to its square root
Tsz Ho Chan

TL;DR
This paper proves that perfect squares have at most five divisors within a specific small interval around their square root, addressing a conjecture by Erdős and Rosenfeld.
Contribution
It establishes a bound on the number of divisors near the square root of perfect squares, confirming a conjecture for this special case.
Findings
Every perfect square has at most five divisors close to its square root.
The result applies to divisors within a range proportional to the fourth root of the number.
Supports the conjecture of Erdős and Rosenfeld for perfect squares.
Abstract
In this paper, we consider a conjecture of Erd\H{o}s and Rosenfeld when the number is a perfect square. In particular, we show that every perfect square can have at most five divisors between and .
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 · Advanced Mathematical Theories · graph theory and CDMA systems
