# Lower bound on Carmichael Function

What is the tightest lower bound currently known for the Carmichael function?

I imagine it must grow much more slowly than the Euler's totient function which according to here is bounded as

$$\phi(n) \ge \frac{n}{e^{\gamma} \log \log n+ \frac{3}{\log \log n}}$$

But searching around on Google it's hard to find any literature on lower bounds of the carmichael function

• Probably better to search around on MathSciNet, if you have access. Oct 11, 2019 at 20:55
• Have you come across Erdős, Paul; Pomerance, Carl; Schmutz, Eric (1991). "Carmichael's lambda function". Acta Arithmetica. 58 (4): 363–385. MR 1121092. Zbl 0734.11047 and Sándor, Jozsef; Crstici, Borislav (2004). Handbook of number theory II. Dordrecht: Kluwer Academic. pp. 32–36, 193–195. ISBN 978-1-4020-2546-4. Zbl 1079.11001? Oct 11, 2019 at 21:03
• i have not come across that but i went to a certain source of articles, and looked for anything written by carl pomerance with carmichael in its title and I found an article titled "period of the power generator" by him which yielded a lower bound :). Thank you for inspiring the search! Oct 11, 2019 at 21:15
• Erdos' papers are collected at renyi.hu/~p_erdos/Erdos.html (although for some reason, the collection stops at 1989, so Erdos-Pomerance-Schmutz isn't there). The paper is available on Pomerance's website, math.dartmouth.edu/~carlp (and I think Acta Arithmetica has made most of its issues freely available on its website). But maybe you could write up what you found in the "period of the power generator" paper, and post it as an answer? Oct 11, 2019 at 21:34

Theorem $$1$$: For every $$c < 1/\log{2}$$, we have $$\lambda(n) > (\log{n})^{c \log\log\log{n}}$$ for all large enough $$n$$. On the other hand, for some constant $$c'$$, and infinitely many $$n$$, we also have $$\lambda(n) < (\log{n})^{c' \log\log\log{n}}$$.