google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 856

Open
#981 0 comments 0 reactions 0 assignees View on GitHub
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/856

Let $k\geq 3$ and $f_k(N)$ be the maximum value of $\sum_{n\in A}\frac{1}{n}$, where $A$ ranges over all subsets of $\\{1,\ldots,N\\}$ which contain no subset of size $k$ with the same pairwise least common multiple.

Estimate $f_k(N)$.

Status: open

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.