Also known as smallest uninteresting number
logical contradiction in which every possible solution to the problem is exempt: if there were some uninteresting natural numbers, there would be a smallest uninteresting number, which would be therefore interesting
有趣数字悖论是在尝试将自然数分类为「有趣的」与「无趣的」两类数时，产生的一个半开玩笑的悖论。这个悖论宣称，所有的自然数都是有趣的。其「证明」来自于反证法：如果无趣自然数的集合存在，那么其中必然有最小的自然数——然而最小的无趣自然数本身就是一个有趣的数，因为它是最小的无趣自然数，而这便导出了矛盾。
Abstract from DBpedia / Wikipedia · CC BY-SA
via Wikidata sitelinks · CC0
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).