Skip to content

Erdős problem 1064

Start work

Let ϕ(n)ϕ(n) be the Euler's totient function, then the nn satisfies ϕ(n)>ϕ(n−ϕ(n))ϕ(n)>ϕ(n - ϕ(n)) have asymptotic density 1. Reference: [LuPo02] Luca, Florian and Pomerance, Carl, On some problems of {M}\polhk akowski-{S}chinzel and {E}rdős concerning the arithmetical functions {ϕ\phi} and {σ\sigma}. Colloq. Math.

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:6074d8a2675200a02a4868931270bc6d4fd2b40de5f8f3f04dd53d65b1bc3e61
Metadata
sha256:b2c1d5739576391de258599dc84edc23e76e6e29d65d23b600eaf96327291064
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:575cf1e8ef452ed629a3ce0176c4603f3ecc35828ea85e13cba6a2276f3fd77a
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON