google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 432

Open
#729 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)
327

Description

### What is the conjecture

https://www.erdosproblems.com/432

Let $A,B\subseteq \mathbb{N}$ be two infinite sets. How dense can $A+B$ be if all elements of $A+B$ are pairwise relatively prime?

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 with the conjecture statement and the linked Erdős Problems page, then inspect existing formalized conjectures in the repository to find the relevant structure and conventions. Done means adding a Lean formalization of Problem 432 that matches the repository's established pattern.

Written by the indexing model from the issue text.

Assessment

Domain
tooling
Issue type
Feature
Difficulty
4/5
Estimated time
3-5 days
Activity status
Stale
Clarity
Mostly clear
Newbie friendliness
35/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.