Skip to content

Erdős problem 541

Let a1,…,apa_1, \dots, a_p be (not necessarily distinct) residues modulo a prime pp, such that there exists some rr so that if S⊆[p]S \subseteq [p] is non-empty and ∑i∈Sai≡0(modp)\sum_{i \in S} a_i \equiv 0 \pmod{p} then ∣S∣=r|S| = r.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:1138740748aa749c0485f7c42b0d1c74ed7073add3c8b738fe5ca896c636adf8
Metadata
sha256:a40d38abd4b8a522281422908bb48678ebc51059cca1312a18ec476e52557ac1
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:7ef1eb9e03c9bda2d935c4e473e5dde50a648b0acd8f31b031a07fb0d97612f1
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb