Skip to content

Erdős problem 694

Let Unparsed notation: f_\max(n) be the largest mm such that ϕ(m)=n\phi(m) = n, and Unparsed notation: f_\min(n) be the smallest such mm, where ϕ\phi is Euler's totient function. Investigate Unparsed notation: \max_{n\leq x}\frac{f_\max(n)}{f_\min(n)}.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:2fd90d04f2db92e0cb6bbc24ba6faff63a8e645d103cd13000ffbfc56f57fb66
Metadata
sha256:1a10f35800dfd3da5699a665b32d3d01f1c5a30a839007d813d39dd66d28d879
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:0ab876b6389e344d832b0a40545c275276e0c78f9b1d5001dca1f69656f3dae0
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb