Erdős Problem #820 — Let H(n) be the smallest integer l such that there exist k<l with (k^n-1,l^n-1)=1. Is it true that H(n)=3 infinitely often?
Statement
Let be the smallest integer such that there exist with . Is it true that infinitely often? (That is, infinitely often?) Estimate . Is it true that there exists some constant such that, for all , for infinitely many and for all large enough ? Does a similar upper bound hold for the smallest such that ?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.