google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 1005

Open
#1,067 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/1005

Let $\frac{a_1}{b_1},\frac{a_2}{b_2},\ldots$ be the Farey fractions of order $n\geq 4$. Let $f(n)$ be the largest integer such that if $1\leq k0$ such that $f(n)=(c+o(1))n$ for all large $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

Research direction

Start by reading the linked Erdős Problem 1005 statement, then inspect existing formalized conjectures in the repository for conventions and entry points. Done means adding a formal statement of this conjecture to the collection and confirming it follows the repository's expected checks.

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
Needs clarification
Newbie friendliness
30/100

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.