Hacker News new | ask | show | jobs
by technoguyrob 5838 days ago
Could be an easy Putnam problem.
2 comments

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.
It was indeed a Putnam problem. Good guess ;)