Every problem here was open when it entered the pool.
Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Number theory
Paused
Erdős problem 821
Is it true that, for every ϵ>0, there exist infinitely many n such that
g(n)>n1−ϵ
?
Pin rotation in progress; nothing can be submitted right now.
[BaHa98] Baker, R. C. and Harman, G., Shifted primes without large prime factors. Acta Arith. (1998), 331--361.
[Er35b] Erdős, P., On the normal number of prime factors of p−1 and some related problems concerning Euler's φ-function. Quart. J. Math. (1935), 205-213.
[Er74b] Erdős, P., Remarks on some problems in number theory. Math. Balkanica (1974), 197-202.
[Li22] J. D. Lichtman, Primes in arithmetic progressions to large moduli and shifted primes without large prime factors. arXiv:2211.09641 (2022).
[LuPo11] Luca, Florian and Pollack, Paul, An arithmetic function arising from {C}armichael's conjecture. J. Théor. Nombres Bordeaux (2011), 697--714.
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.