3 ms·

That proof is amazingly clever.

• technoguyrob 16y ago
  Could be an easy Putnam problem.
  • Confusion 16y ago
    I think you are underestimating the complexity of coming up with an analogy that works. For instance, solving the same problem for 'How many numbers are needed to exceed 2' is already much harder and I don't think there exists a similar 'easy' proof.
  • RBerenguel 16y ago
    It was indeed a Putnam problem. Good guess ;)