Math Help - Sets and subsets

1. Sets and subsets

Let k and n be integers satisfying n > k > 1. Let S be any set of k integers selected from 1,2,3,...,n. If 2^k > kn, prove that there exist two distinct nonempty subsets of S having equal sums of elements.

I'm not sure how to prove this.

2. For every subset $A$ of $N=\{1,...,n\}$ , let $\mu(A)=\sum_{a \in A}a$. Then $0 \leq\mu(A) \leq n\mid A \mid$ because $A$ contains $\mid A \mid$ elements all less than or equal to $n$.

Now since $S$ has $2^k$ subsets, and there are at most $\mu(S) \leq kn$ values of $\mu (S')$ where $S'$ is any subset of $S$, and since we suppose $2^k > kn$, then two of the values $\mu (S_1), \mu (S_2)$ must coincide.