What is upper bound for the largest prime in a counter-example for robin's inequality ?!
Assume that $\frac{\sigma(n)}{ n \ln \ln n} > e^\gamma$ for some $n>5040$, and let $p$ be the biggest prime dividing $n$ what is the known upper bound for $p$.
I did search in known papers and found upper bound for $SA$, $CA$ , and all these classes, but i want a more general upper bound not specific for an subset of numbers.
But from my search i have a pretty good guess that $p \approx \ln n$ but could not prove it ??!