google-deepmind / google-deepmind/formal-conjectures
Erdős Probelm 425
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/425
Let $F(n)$ be the maximum possible size of a subset $A\subseteq\\{1,\ldots,N\\}$ such that the products $ab$ are distinct for all $a
Contributor guide
Assessment
This issue has not been assessed yet.