Here's a cute problem that was frequently given by the late Herbert Wilf during his talks.
Problem: Let $A$ be an $n \times n$ matrix with entries from $\{0,1\}$ having all positive eigenvalues. Prove that all of the eigenvalues of $A$ are $1$.
Proof:
Use the AM-GM inequality to relate the trace and determinant.
Is there any other proof?