Problems
Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.
2 problems
showing 1–2
Can there be a finite covering system of the integers with distinct moduli, all of which are odd and greater than 1?
For the least k at which the small-prime part of binomnk exceeds n^2, how large can f(n) be?