google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 177

Open
#406 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/177

Find the smallest $h(d)$ such that the following holds. There exists a function $f:\mathbb{N}\to\\{-1,1\\}$ such that, for every $d\geq 1$,

$$\max_{P_d}\left\lvert \sum_{n\in P_d}f(n)\right\rvert\leq h(d),$$
where $P_d$ ranges over all finite arithmetic progressions with common difference $d$.

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.