google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 864

Open
#988 0 comments 0 reactions 0 assignees View on GitHub
ams-05: Combinatorics 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/864

Let $A\subseteq \\{1,\ldots N\\}$ be a set such that there exists at most one $n$ with more than one solution to $n=a+b$ (with $a\leq b\in A$). Estimate the maximal possible size of $\lvert A\rvert$ - in particular, is it true that
$$\lvert A\rvert \leq (1+o(1))\frac{2}{\sqrt{3}}N^{1/2}?$$

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

Research direction

Begin with the conjecture at https://www.erdosproblems.com/864 and inspect existing formalized conjectures in the repository to learn its expected conventions. The issue is done when Problem 864 has been added in the project's formalization style; no file or test is named here.

Written by the indexing model from the issue text.

Assessment

Domain
tooling
Issue type
Feature
Difficulty
5/5
Estimated time
Over a week
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.