A note on the ErdH{o}s distinct subset sums problem
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:I5WZYIWQrecord.jsonopen to challenge →
classification
math.CO
math.NTmath.PR
keywords
distinctsubsetsumsasymptoticbestboundelementgiving
read the original abstract
We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.