Recently I read two interesting questions. Let me share them here.
1)
Find a smallest finite set of integers, such that every integer in the set is the sum of two other distinct elements in the set. There is one another rule: if x is an element of the set, then -x must NOT be an element of the set.
2)
A square matrix is said to be doubly stochastic if the entries in each row and in each column sum to the same value.
A permutation matrix is a square matrix where each entry in the matrix is either 0 or 1, and there is one and only one entry in each row and in each column which is 1.
Prove that any doubly stochastic matrix is a convex linear combination of permutation matrices.
Comment: The first question is interesting by itself. The second question is considered interesting because an easy solution by induction is possible, after knowing a combinatorial theorem called Hall's Theorem. The question itself may mislead you to some linear algebra arguments.