TL;DR
This paper investigates the distribution of prime pairs where the product of one less than each prime is a perfect square, providing bounds on their quantity up to a certain limit.
Contribution
It establishes matching order bounds on the number of prime pairs with the property that their (p-1)(q-1) product is a perfect square.
Findings
Derived upper and lower bounds of matching order for prime pairs
Quantified the frequency of primes p,q with (p-1)(q-1) as a perfect square
Contributed to understanding the distribution related to a famous prime conjecture
Abstract
A well-known conjecture asserts that there are infinitely many primes for which is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes for which is a perfect square.
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.