google-deepmind / google-deepmind/formal-conjectures

Erdős Problem 475

Open
#749 0 comments 0 reactions 0 assignees View on GitHub
ams-05: Combinatorics 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/475

Let $p$ be a prime. Given any finite set $A \subseteq \mathbb{F}_p \setminus \\{ 0 \\}$, is there always a rearrangement
$A=\\{a_1, \ldots,a_t\\}$ such that all partial sums $\sum^{1\leq k\leq m} a_k$ are distinct, for all $1\leq m\leq t$?

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.