Back to Problems

erdos_541

Specification

Let $a_1, \dots, a_p$ be (not necessarily distinct) residues modulo a prime $p$, such that there exists some $r$ so that if $S \subseteq [p]$ is non-empty and $$\sum_{i \in S} a_i \equiv 0 \pmod{p}$$ then $|S| = r$. Must there be at most two distinct residues amongst the $a_i$?

Actions

Submit a Proof

Have a proof attempt? Submit it for zero-trust verification.

Submit Proof
Lean 4 Statement
theorem erdos_541 : answer(True) ↔ (∀ p, Fact p.Prime → ∀ (a : Fin p → ZMod p),
    (∃ r, ∀ (S : Finset (Fin p)), S ≠ ∅ → ∑ i ∈ S, a i = 0 → S.card = r) →
      (Set.range a).ncard ≤ 2)
ID: ErdosProblems__541__erdos_541
Browse 300 unsolved math conjectures formalized in Lean 4
Browse

All Problems

Explore all 300 unsolved conjectures.

View problems →
ASI Prize documentation for formal verification pipeline
Docs

Verification Pipeline

How zero-trust verification works.

Read docs →
Evaluation Results

Recent Submissions

No submissions yet. Be the first to attempt this problem.