google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 791

Open
#948 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/791

Let $g(n)$ be minimal such that there exists $A\subseteq \\{0,\ldots,n\\}$ of size $g(n)$ with $\\{0,\ldots,n\\}\subseteq A+A$. Estimate $g(n)$. In particular is it true that $g(n)\sim 2n^{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

Start by reading the conjecture and its status at https://www.erdosproblems.com/791, then inspect the formal-conjectures repository to find how similar Erdős problems are represented. Done means adding a Lean formalization of the stated conjecture, with any repository-required validation passing.

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.