google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 793

Open
#950 0 comments 0 reactions 1 assignee Claimed by @danielchin 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/793

Let $F(n)$ be the maximum possible size of a subset $A\subseteq\\{1,\ldots,N\\}$ such that $a\nmid bc$ whenever $a,b,c\in A$ with $a\neq b$ and $a\neq c$. Is there a constant $c$ such that
$$F(n)=\pi(n)+(c+o(1))n^{2/3}(\log n)^{-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

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.