Claims

../

1974_04_01_benkoski_erdos: Theorem 1 of Benkoski and Erdős (Math. Comp. 1974), by an argument credited to C. Ryavec, proves that a set of positive integers with distinct subset sums has reciprocal sum below two, with the refinement 2 - 2^(1-n); accepted.

1977_09_01_hanson_steele_stenger: A two-page note (Proc. Amer. Math. Soc. 1977) proving that a set with distinct subset sums has sum of n^(-s) below 1/(1 - 2^(-s)) for every s > 0; s = 1 is the problem's bound. Accepted on the publication and the site's credit.

---