google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 393
Open
ams-11: Number theory
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 328
Description
### What is the conjecture
https://www.erdosproblems.com/393
Let $f(n)$ denote the minimal $m\geq 1$ such that
$$n! = a_1\cdots a_t$$
with $a_1<\cdots
Contributor guide
Assessment
This issue has not been assessed yet.