MathDB

Fix a set of integers

S

. An integer is clean if it is the sum of distinct elements of

S

in exactly one way, and dirty otherwise. Prove that the set of dirty numbers is either empty or infinite.
Note: We consider the empty sum to equal

0

.
Proposed by Tony Wang and Ethan Tan

Problem Statement