OFFSET
1,2
LINKS
International Mathematical Olympiad, Problem N6, IMO-2020, p. 81.
MATHEMATICA
max=0; lst={}; Do[t=EulerPhi[DivisorSigma[0, k]]/DivisorSigma[0, EulerPhi@k]; If[t>max, AppendTo[lst, k]; max=t], {k, 100000}]; lst (* Giorgos Kalogeropoulos, Jul 27 2021 *)
PROG
(PARI) lista(nn) = my(r, t); for(k=1, nn, if(r<t=eulerphi(numdiv(k))/numdiv(eulerphi(k)), r=t; print1(k, ", ")));
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jinyuan Wang, Jul 24 2021
EXTENSIONS
a(14)-a(16) from Amiram Eldar, Jul 30 2021
STATUS
approved
