Misplaced Pages

Strong law of small numbers: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 08:39, 2 March 2021 editSalix alba (talk | contribs)Edit filter managers, Administrators26,099 editsm Reverted edits by 御犽真夜魂 (talk) to last version by Salix albaTag: Rollback← Previous edit Revision as of 13:12, 21 March 2021 edit undoSoap (talk | contribs)Extended confirmed users, Rollbackers29,074 editsNo edit summaryNext edit →
Line 2: Line 2:
{{Other uses|Law of small numbers (disambiguation)}} {{Other uses|Law of small numbers (disambiguation)}}


] as an example. The number of {{nowrap|points (''n''),}} {{nowrap|chords (''c'')}} and {{nowrap|regions (''r<sub>G</sub>'')}}. The first five terms for the number of regions follow a simple sequence, broken by the six term.]] ] as an example. The number of {{nowrap|points (''n''),}} {{nowrap|chords (''c'')}} and {{nowrap|regions (''r<sub>G</sub>'')}}. The first five terms for the number of regions follow a simple sequence, broken by the sixth term.]]


In ], the "'''Strong Law of Small Numbers'''" is the humorous law that proclaims, in the words of ] (1988):<ref>{{Cite journal In ], the "'''Strong Law of Small Numbers'''" is the humorous law that proclaims, in the words of ] (1988):<ref>{{Cite journal

Revision as of 13:12, 21 March 2021

Humorous mathematical law For other uses, see Law of small numbers (disambiguation).
Guy gives Moser's circle problem as an example. The number of points (n), chords (c) and regions (rG). The first five terms for the number of regions follow a simple sequence, broken by the sixth term.

In mathematics, the "Strong Law of Small Numbers" is the humorous law that proclaims, in the words of Richard K. Guy (1988):

There aren't enough small numbers to meet the many demands made of them.

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. Earlier (1980) this "law" was reported by Martin Gardner. Guy's paper gives numerous examples in support of this thesis.

Guy also formulated the Second Strong Law of Small Numbers:

When two numbers look equal, it ain't necessarily so!

Guy explains the latter law by the way of examples: he cites numerous sequences for which observing a subset of the first few members may lead to a wrong guess about the generating formula or law for the sequence. Many of the examples are the observations of other mathematicians.

Some examples Guy gives include the Moser's circle problem, Mersenne prime where 2 p − 1 {\displaystyle 2^{p}-1} is prime when p {\displaystyle p} is one of the first few primes but fails for 2 11 − 1 {\displaystyle 2^{11}-1} , and the Prime number race where primes congruent to 3 modulo 4 appear to be more numerous that those congruent to 1, this first fails for primes less than 26861.

See also

Notes

  1. Guy, Richard K. (1988). "The Strong Law of Small Numbers" (PDF). American Mathematical Monthly. 95 (8): 697–712. doi:10.2307/2322249. ISSN 0002-9890. JSTOR 2322249. Retrieved 2009-08-30.
  2. Gardner, M. "Mathematical Games: Patterns in Primes are a Clue to the Strong Law of Small Numbers." Sci. Amer. 243, 18-28, Dec. 1980.
  3. ^ Guy, Richard K. (1990). "The Second Strong Law of Small Numbers". Mathematics Magazine. 63 (1): 3–20. doi:10.2307/2691503. JSTOR 2691503.

External links


Stub icon

This article about a mathematical publication is a stub. You can help Misplaced Pages by expanding it.

Categories: