A note on square totients
classification
🧮 math.NT
keywords
squareperfectprimesassertsboundsconjecturedistinctinfinitely
read the original abstract
A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q - 1)$ is a perfect square.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.