Tag Archives: Unsolved problems

Singmaster’s conjecture

From time to time one runs across things that seem like they must be easy but actually aren’t (e.g.). Singmaster’s conjecture and associated questions certainly belong in that category. The following things are easy to prove: Currently, and shockingly, no … Continue reading

Posted in Combinatorics, Math | Tagged , , | Leave a comment