google-deepmind / google-deepmind/formal-conjectures
Erdős Problem 148: number of ways of writing 1 as Egyptian fraction
Open
ams-11: Number theory
erdos-problems
new conjecture
- Dominant language
- Lean
- Stars
- 1.3k
- Forks
- 485
- Avg merge
- 1d 20h
- Merged PRs (30d)
- 327
Description
### What is the conjecture
https://www.erdosproblems.com/148
Let $F(k)$ be the number of solutions to
$$1= \frac{1}{n_1}+\cdots+\frac{1}{n_k},$$
where $1\leq n_1<\cdots
Contributor guide
Assessment
This issue has not been assessed yet.