MathDB

Endre wrote

n

(not necessarily distinct) integers on a paper. Then for each of the

2^n

subsets, Kelemen wrote their sum on the blackboard. a) For which values of

n

is it possible that two different

n

-tuples give the same numbers on the blackboard? b) Prove that if Endre only wrote positive integers on the paper and Ferenc only sees the numbers on the blackboard, then he can determine which integers are on the paper.

Problem Statement