PROBLEM ON A SET HAVING DISTINCT SUBSET SUMS"> AN EQUIVALENT FORMULATION TO AN $ERD\"{O}S'$ PROBLEM ON A SET HAVING DISTINCT SUBSET SUMS

  • Bae, Jae-Gug (Department of Applied Mathematics Korea Maritime University)
  • Published : 2001.06.25

Abstract

We give an equivalent formulation to the $Erd\"{o}s'$ conjecture on the lower bound of the greatest element in a set having distinct subset sums. On this basis we suggest a possible approach towards $ERD\"{O}S'$ conjecture. Also we reproduce L. Moser's result by means of an analytic method.

Keywords