Strong Law of Small Numbers

From Wikipedia, the free encyclopedia
  (Redirected from Strong law of small numbers)
Jump to: navigation, search

"The Strong Law of Small Numbers" is the humorous title of a popular paper by mathematician Richard K. Guy and also the so-called law that it proclaims: "There aren't enough small numbers to meet the many demands made of them."[1] In other words, any given small number appears in far more contexts than may seem reasonable, leading to many apparently surprising coincidences in mathematics, simply because small numbers appear so often and yet are so few. Guy's 1988 paper gives 35 examples in support of this thesis. This can lead inexperienced mathematicians to conclude that these concepts are related, which in fact they are not.

Guy's observation has since become part of mathematical folklore, and is commonly referenced by other authors.[2]

See also[edit]

Notes[edit]

  1. ^ Guy, Richard K. (October 1988). "The Strong Law of Small Numbers". American Mathematical Monthly 95 (8): 697–712. doi:10.2307/2322249. ISSN 0002-9890. JSTOR 2322249. 
  2. ^ Wells, David (2005). Prime Numbers: The Most Mysterious Figures in Math. Hoboken: John Wiley & Sons. p. 31. 

External links[edit]