Interesting number paradox

Interesting number paradox

The interesting number paradox is a semi-humorous paradox that arises from attempting to classify numbers as "interesting" or "dull". The paradox states that all numbers are interesting. The "proof" is by contradiction: if there were uninteresting numbers, there would be a "smallest" uninteresting number - but the smallest uninteresting number is itself interesting, producing a contradiction.

Proof

Claim: There is no such thing as an uninteresting natural number.

Proof by Contradiction: Assume that you have a non-empty set of natural numbers that are not interesting. Due to the well-ordered property of the natural numbers, there must be some smallest number in the set of not interesting numbers. Being the smallest number of a set one might consider not interesting makes that number interesting. Since the numbers in this set were defined as not interesting, we have reached a contradiction because this smallest number cannot be both interesting and uninteresting. Therefore the set of uninteresting numbers must be empty, proving there is no such thing as an uninteresting number.

Paradoxical Nature

Attempting to classify all numbers this way leads to a paradox or an antinomy of definition. Any hypothetical partition of natural numbers into "interesting" and "dull" sets seems to fail. Since the definition of interesting is usually a subjective, intuitive notion of "interesting", it should be understood as a half-humorous application of self-reference in order to obtain a paradox. However, as there are many significant results in mathematics that make use of self-reference (such as Gödel's Incompleteness Theorem), the paradox illustrates some of the power of self-reference, and thus touches on serious issues in many fields of study.

This version of the paradox applies only to well-ordered sets with a natural order, such as the natural numbers, as it depends on mathematical induction, which is only applicable to sets that are well-ordered; the argument does not apply to the real numbers. However, it would apply to the real numbers together with a natural and fixed well-ordering.

One obvious weakness in the proof is that we have not properly defined the predicate of "interesting". But assuming this predicate is defined with a finite, definite list of "interesting properties of positive integers", and is defined self-referentially to include the smallest number not in such a list, a paradox arises. The Berry paradox is closely related, arising from a similar self-referential definition. As the paradox lies in the definition of "interesting", it applies only to persons with particular opinions on numbers: if one's view is that all numbers are boring, and one finds uninteresting the observation that 0 is the smallest boring number, there's no paradox.

Another weakness in the proof is the assumption that what is interesting now was indeed interesting previously or will be interesting in the future (that "intrinsic interestingness" does not change). Yet another weakness is the dynamic nature of the solution but the static nature of the presentation of the problem (wherein lies the humor of the paradox). The proof essentially has the same weaknesses as most paradoxes/proofs of changing referents (e.g., the ontological proof of the existence of God).

ee also

*Grelling-Nelson paradox
*Richard's paradox
*Church-Turing thesis
*Gödel's incompleteness theorem
*Hardy-Ramanujan number
*List of paradoxes

Further reading

*Martin Gardner, "Mathematical Puzzles and Diversions", 1959 (ISBN 0-226-28253-8)
*Mike Keith: [http://users.aol.com/s6sj7gt/interest.htm All Numbers Are Interesting: A Constructive Approach]


Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Berry paradox — The Berry paradox is a self referential paradox arising from the expression the smallest possible integer not definable by a given number of words. Bertrand Russell, the first to discuss the paradox in print, attributed it to G. G. Berry, a… …   Wikipedia

  • 1729 (number) — This article is about the number. For the year, see 1729. List of numbers Integers ← 1k 2k 3k 4k 5k 6k 7k 8k 9k → 1729 Cardinal …   Wikipedia

  • Unexpected hanging paradox — The unexpected hanging paradox is an alleged paradox about a prisoner s response to an unusual death sentence. It is alternatively known as the hangman paradox, the fire drill paradox, or the unexpected exam (or pop quiz) paradox.Despite… …   Wikipedia

  • number game — Introduction       any of various puzzles and games that involve aspects of mathematics.       Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… …   Universalium

  • Paradox — For other uses, see Paradox (disambiguation). Further information: List of paradoxes A paradox is a seemingly true statement or group of statements that lead to a contradiction or a situation which seems to defy logic or intuition. Typically,… …   Wikipedia

  • number symbolism — Introduction       cultural associations, including religious, philosophic, and aesthetic, with various numbers.       Humanity has had a love hate relationship with numbers from the earliest times. Bones dating from perhaps 30,000 years ago show …   Universalium

  • D'Alembert's paradox — In fluid dynamics, d Alembert s paradox (or the hydrodynamic paradox) is a contradiction reached in 1752 by French mathematician Jean le Rond d Alembert.[1] D Alembert proved that – for incompressible and inviscid potential flow – the drag force… …   Wikipedia

  • Ross–Littlewood paradox — A graph that shows the number of balls in and out of the vase for the first ten iterations of the problem. The Ross–Littlewood paradox (also known as the balls and vase problem or the ping pong ball problem) is a hypothetical problem in abstract… …   Wikipedia

  • Epimenides paradox — Epimenides from Promptuarii Iconum Insigniorum The Epimenides paradox is a problem in logic. It is named after the Cretan philosopher Epimenides of Knossos (alive circa 600 BC), There is no single statement of the problem; a typical variation is… …   Wikipedia

  • Nakamura number — In cooperative game theory and social choice theory, the Nakamura number measures the degree of rationality of preference aggregation rules (collective decision rules), such as voting rules. It is an indicator of the extent to which an… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”