google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 524

Open
#770 1 comment 0 reactions 0 assignees View on GitHub
ams-60: Probability 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/524

For any $t\in (0,1)$ let $t=\sum_{k=1}^\infty \epsilon_k(t)2^{-k}$ (where $\epsilon_k(t)\in \\{0,1\\}$). What is the correct order of magnitude (for almost all $t\in(0,1)$) for
$$M_n(t)=\max_{x\in [0,1]}\left\lvert \sum_{k\leq n}\epsilon_k(t)x^k\right\rvert?$$

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.