ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pnp_n be the smallest prime ≡1(modn)\equiv 1\pmod{n} and let mnm_n be the smallest integer such that n∣ϕ(mn)n\mid \phi(m_n). Is it true that mn<pnm_n<p_n for almost all nn? Does pn/mn→∞p_n/m_n\to \infty for almost all nn? Are there infinitely many primes pp such that p−1p-1 is the only nn for which mn=pm_n=p?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.