List of examples of Stigler's law
Stigler's law concerns the supposed tendency of eponymous expressions for scientific discoveries to honor people other than their respective originators.
Examples include:
A
- Aharonov–Bohm effect. Werner Ehrenberg and Raymond E. Siday first predicted the effect in 1949, and similar effects were later rediscovered by Yakir Aharonov and David Bohm in 1959.
- Arabic numerals, first developed in India around 7th century.
- Argand diagram by Caspar Wessel in 1797, predating Jean-Robert Argand by 9 years.
- Arrhenius equation. The equation was first proposed by the Dutch chemist J. H. van 't Hoff in 1884; five years later in 1889, the Swedish chemist Svante Arrhenius provided a physical justification and interpretation for it.
- Auger effect. First discovered by Lise Meitner in 1922 and then, independently, in 1923 by Pierre Victor Auger.
B
- Bailey–Borwein–Plouffe formula was discovered by Simon Plouffe, who has since expressed regret at having to share credit for his discovery.
- Bechdel test, a gender bias test for films popularised by and named after Dykes to Watch Out For comic strip writer Alison Bechdel, despite her repeated insistence that the test was devised by her friend Liz Wallace.
- Bellman-Ford algorithm, which is an algorithm for computing the shortest-length path, was proposed by Alfonso Shimbel, who presented the algorithm in 1954, but was named after Richard Bellman and Lester Ford Jr., who published equivalent forms in 1956 and 1958.
- Benford's law, named after physicist Frank Benford, who stated it in 1938, although it had been previously stated by Simon Newcomb in 1881.
- Bertrand's ballot theorem proved using André's reflection method, which states the probability that the winning candidate in an election stays in the lead throughout the count. It was first published by W. A. Whitworth in 1878, nine years before Joseph Louis François Bertrand; Désiré André's proof did not use reflection, though reflection is now the method commonly taught.
- The Bessemer process was discovered by William Kelly in 1851. Henry Bessemer was the first to obtain a patent in 1855.[1][2]
- Betz' law, which shows the maximum attainable energy efficiency of a wind turbine, was discovered first by Frederick W. Lanchester. It was subsequently independently rediscovered by Albert Betz and also Nikolai Zhukovsky.
- Betteridge's law of headlines, stating that when a headline asks a (yes-no) question, the answer is no. Considered "an old truism among journalists", it was well known before Betteridge wrote about it in 2009.
- The Bilinski dodecahedron appears in a 1752 book by John Lodge Cowley but is named after Stanko Bilinski, who rediscovered it in 1960.
- Blount's disease was described independently by C. Mau (1923) and Harald Nilsonne (1929), both writing in German, before it was described in English by Walter Putnam Blount (1937).
- Bode's law of 1772 states that the distances of the planets from the sun follow a simple arithmetical rule. But it was first stated by Johann Titius in 1766, not Johann Elert Bode.
- The Bonferroni correction is named after Italian mathematician Carlo Emilio Bonferroni for its use of Bonferroni inequalities.[3] However, its development is often credited to Olive Jean Dunn, who described the procedure's application to confidence intervals.[4][5]
- Burnside's lemma, a counting technique in Group Theory was discovered by Augustin Louis Cauchy, or possibly others. William Burnside originally attributed it to Ferdinand Georg Frobenius. Ironically, Burnside made many original contributions to Group Theory, and Burnside's Lemma is sometimes jokingly referred to as "the lemma that is not Burnside's".
- Boyce–Codd normal form, a normal form used in database normalization. Definition of what we now know as BCNF appeared in a paper by Ian Heath in 1971.[6] Date writes:
"Since that definition predated Boyce and Codd's own definition by some three years, it seems to me that BCNF ought by rights to be called Heath normal form. But it isn't."[7]
- Buridan's ass originates from the Persian philosopher Al-Ghazali. The version popularised by Jean Buridan also does not include the eponymous donkey.
C
- Cantor–Bernstein–Schröder theorem (also known by other variations, such as Schröder-Bernstein theorem) first proved by Richard Dedekind
- Cantor set: discovered in 1874 by Henry John Stephen Smith and introduced by German mathematician Georg Cantor 1883.
- Carmichael number: Václav Šimerka listed the first seven Carmichael numbers in 1885; they are named after Robert Daniel Carmichael who subsequently discovered the first one in 1910.[8]
- Cartan matrices: first investigated by Wilhelm Killing.
- Cardano's formula: The solution to general Cubic equations, is known as Cardano's formula, despite Cardano stating that it was discovered by Scipione del Ferro, who passed the knowledge to his student Antonio Maria Fior. Around 1535 Niccolò Fontana Tartaglia learned of this from Fior and re-derived the formula for the cubic, which he later shared with Cardano.[9][10]
- Cassegrain reflector, named after a design published in 1672 which has been attributed to Laurent Cassegrain,[11] but was already known to Bonaventura Cavalieri in 1632[12] and Marin Mersenne in 1636.[13]
- Cartesian duality: Named for Rene Descartes, but Teresa of Avila and her contemporaries wrote about similar methods of philosophical exploration 8 to 10 years before Descartes was born.[14]
- Cavendish balance: for measuring the universal gravitational constant, first devised and constructed by John Michell.
- Chandrasekhar limit: The mass upper limit of a white dwarf, it was first discovered by Wilhelm Anderson and E. C. Stoner, and was only later improved by Subrahmanyan Chandrasekhar.
- Chebyshev's inequality: Guarantees that, for a wide class of probability distributions, no more than a certain fraction of values can be more than a certain distance from the mean. It was first formulated by his friend and colleague Irénée-Jules Bienaymé in 1853 and proved by Chebyshev in 1867.
- Chernoff bound: A bound on the tail distribution of sums of independent random variables, named after Herman Chernoff but due to Herman Rubin,[15]
- Cobb–Douglas: A production function named after Paul H. Douglas, and Charles W Cobb, developed earlier by Philip Wicksteed.
- Cooley–Tukey algorithm named after J. W. Cooley and John Tukey but invented 160 years earlier in 1805 by Carl Friedrich Gauss.
- Curie point: a critical temperature of phase change in ferromagnetism. Named after Pierre Curie, who reported it in his thesis in 1895, but the phenomenon was found by Claude Pouillet before 1832.[16]
- Currying: a technique for transforming an n-arity function to a chain of functions. Named after Haskell Curry, though it was originally discovered by Moses Schönfinkel.
D
- Deming cycle of continuous improvement. Deming himself always referred to it as the "Shewhart cycle".
- De Morgan's laws of logic, transformation rules of propositional logic. Named after 19th-century British mathematician Augustus De Morgan, but already known to medieval philosophers such as Jean Buridan.
- Dyson spheres are named after Freeman Dyson, but Dyson himself has credited the original idea to Olaf Stapledon.
E
- Euler's number: the "discovery" of the constant itself is credited to Jacob Bernoulli, but it is named after Leonhard Euler.
- Euler's formula: an equivalent formula was proved by Roger Cotes 30 years before Euler published his proof.
F
- Farey sequence. Cauchy published the proof to a conjecture put forth by Farey. Unknown to both men, similar results were published earlier by Charles Haros.
- Fast Fourier transform. The algorithm proposed in 1965 by Cooley and Tukey to interpolate the coefficients of a polynomial from its evaluations in a quasi-linear number of multiplication was invented in 1805 by Gauss.
- Fermat's Last Theorem. An unusual example in that it is named after Pierre de Fermat who proposed it three and a half centuries prior to its proof by Andrew Wiles.
- Fermi's golden rule, a quantum mechanical calculation, was discovered by Paul Dirac.
- The Fermi paradox, stated (in an unpublished work) by Konstantin Tsiolkovsky in 1933, long before Fermi. Tsiolkovsky, in turn, stated that others had already considered this question.
- The Floyd–Warshall algorithm for finding shortest paths in a weighted graph is named after Robert Floyd and Stephen Warshall who independently published papers about it in 1962. However, Bernard Roy had previously published an equivalent algorithm in 1959.
- The Fraunhofer lines in the solar spectrum were first noted by William Hyde Wollaston twelve years before they were rediscovered and studied systematically by Joseph von Fraunhofer.
- Fresnel lens. The idea of creating a thinner, lighter lens by making it with separate sections mounted in a frame is often attributed to Georges-Louis Leclerc.
- Frobenius elements in a Galois group of global fields were first created by Dedekind.
- Fibonacci numbers. Fibonacci was not the first to discover the famous sequence. They existed in Indian mathematics since 200 BC (Fibonacci gave the series in 1202 AD)
G
- Gauss's theorem: first proved by Ostrogradsky in 1831.
- Gaussian distribution: the normal distribution was introduced by Abraham de Moivre in 1733, but named after Carl Friedrich Gauss who began using it in 1794.
- Gaussian elimination: was already in well-known textbooks such as Thomas Simpson's when Gauss in 1809 remarked that he used "common elimination."
- Gibbs phenomenon: named for Josiah Willard Gibbs who published in 1901. First discovered by Henry Wilbraham in 1851.
- The Graetz circuit, also known as the diode bridge, was invented and patented in 1896 by Karol Pollak a year before it was published by Leo Graetz.
- The Gregorian telescope is named after James Gregory, who published it in 1663, but was already known to Bonaventura Cavalieri in 1632[17] and Marin Mersenne in 1636.[18]
- Gresham's law was described by Nicolaus Copernicus in 1519, the year of Thomas Gresham's birth.
- Gröbner basis: the theory was developed by Bruno Buchberger, who named them after his advisor, Wolfgang Gröbner
H
- Halley's comet was observed by astronomers since at least 240 BC, but named after Edmond Halley who computed its orbit and accurately predicted its return.
- Hasse diagrams were used by Henri Gustav Vogt three years before the birth of Helmut Hasse.
- Higgs field is named after Peter Higgs but was first theorized by Robert Brout and François Englert, albeit not published before Higgs had submitted his own paper.
- Hodrick–Prescott filter was popularized in the field of economics in the 1990s by economists Robert J. Hodrick and Nobel Memorial Prize winner Edward C. Prescott.[19] However, it was first proposed much earlier by E. T. Whittaker in 1923.[20]
- Hubble's law was derived by Georges Lemaître two years before Edwin Hubble.
I
- Ising model was invented by Wilhelm Lenz, but given to his student Ernst Ising to study.
J
- Jacobson's organ was first discovered by Frederik Ruysch before 1732.
- Jordan's Law (in the sense of sister species often being allopatric): Jordan himself gives Wagner credit for earlier observation of this pattern.
- Joukowski transformation was first derived by Otto Blumenthal in 1913. Edit: A mere 3 years after Joukowski (who was actually Nikolay Zhukovsky), published it in 1910. [21]
K
- Kasiski analysis: invented by Charles Babbage who recorded it in his diary but didn't otherwise publish it.
- Kepler's Supernova was first observed by Italian astronomers several days before Johannes Kepler
- Killing form: invented by Élie Cartan
- Kuiper belt: theoretically described by a number of astronomers before Gerard Kuiper; Kuiper theorized that such a belt no longer existed.
- Kodály method: was conceived and developed for music teaching by Jenő Ádám; a pupil of Kodály.
- Kronecker product: Johann Georg Zehfuss already in 1858 described the matrix operation we now know as the Kronecker product
L
- L'Hôpital's rule to calculate the limit of quotient of functions at a point were both functions converge to 0 (or both converge to infinity) is named after Guillaume de l'Hôpital, but is generally believed to have been discovered by Johann Bernoulli.
- Lamarckism is generally used to refer to the idea of inheritance of acquired characteristics or soft inheritance, but the idea predates Jean-Baptiste Lamarck and was not the central part of his theory of transmutation of species.
- Lambert–Beer law was discovered by Pierre Bouguer.
- Laplace–Runge–Lenz vector was first discovered as a conserved quantity by Jakob Hermann and Johann Bernoulli.
- Leibniz formula for π: The formula was first discovered by 15th-century Indian mathematician Madhava of Sangamagrama, but it is named after Gottfried Leibniz after the latter discovered it independently 300 years later.
- Lexis diagram is named after Wilhelm Lexis but was previously theorized by Gustav Zeuner and Otto Brasche.
- The Liebig condenser, which Justus von Liebig popularized, was attributed to Göttling by Liebig himself, but had already been developed independently by Poisonnier, Weigel, and Gadolin.
- Lhermitte's sign in neurology, the "barber chair phenomenon" was first described by Pierre Marie and Chatelin. French neurologist Jean Lhermitte published his first report three years later.
- Linus's law: named after Linus Torvalds, but actually described by Eric S. Raymond in The Cathedral and the Bazaar.
M
- Madelung rule, describing the order in which electron orbitals are filled, named after Erwin Madelung but first discovered by Charles Janet.
- Matthew effect, named by Robert K. Merton after the writer of the Gospel of Matthew quoting the words of Jesus.
- Meadow's law, the formulation that one cot death in a family is tragic, two suspicious, and three murder, originally described by D.J. and V.J.M. Di Maio.
- Metropolis–Hastings algorithm. The algorithm was named after Nicholas Metropolis, who was the director of the Theoretical Division of Los Alamos National Laboratory at the time of writing the paper Equation of State Calculations by Fast Computing Machines. However, Metropolis did not contribute to that study in any way, as confirmed by various sources. The research problem was proposed by Augusta H. Teller and solved by Marshall N. Rosenbluth and Arianna W. Rosenbluth. Furthermore, according to Roy Glauber and Emilio Segrè, the original algorithm was invented by Enrico Fermi and reinvented by Stan Ulam.
N
- Newton's first and second laws of mechanics were known and proposed in separate ways by Galileo, Hooke and Huygens before Newton did in his Philosophiæ Naturalis Principia Mathematica. Newton owns the discovery of only the third one.[22]
- Norman's law, proposed by Donald Norman, is a general restatement of Stigler's Law, "No saying or pronouncement is named after its originator." This law was named for Norman as an example of Stigler's Law – which was, itself, not named after its originator.[23]
- Norton's theorem was published on November 1926 by Hans Ferdinand Mayer and independently discovered by Edward Lawry Norton who presented it in an internal Bell Labs technical report, dated November 1926.
O
- The Oort cloud around the solar system was first postulated by Ernst Öpik in 1932 and independently introduced by Jan Oort in 1960.
- Olbers' paradox was formulated by Kepler in the 17th century, long before Olbers was born.
P
- Pascal's triangle: named after and discovered by Pascal, but identified several times before him independently.
- Pearson's Coefficient of Correlation: was originally derived by Auguste Bravais and published in 1846.[24][25]
- Pell's equation, studied in ancient India, but mistakenly attributed to John Pell by Leonhard Euler. Apparently Euler confused Lord Brouncker (first European mathematician to find a general solution of the equation) with Pell.
- Penrose triangle, an impossible object, first created by the Swedish artist Oscar Reutersvärd in 1934. The mathematician Roger Penrose independently devised and popularised it in the 1950s
- Petersen graph as an example in graph theory, put forward by Julius Petersen in 1898, though it previous appeared in a paper by A. B. Kempe (1886).
- Playfair's axiom, an alternative to Euclid's fifth postulate on parallel lines, first stated by Proclus in the 5th century AD but named after John Playfair after he included it in his 1795 book Elements of Geometry and credited it to William Ludlam.
- Playfair cipher, invented by Charles Wheatstone in 1854, but named after Lord Playfair who promoted its use.
- Poe's law, formally stated by Nathan Poe in 2005, but following Internet norms going back as far as Jerry Schwarz in 1983.
- The Poincaré disk model and the Poincaré half-plane model of hyperbolic geometry are named after Henri Poincaré who studied them in 1882. However, Eugenio Beltrami published a paper on these models previously in 1868.
- Poisson spot: predicted by Fresnel's theory of diffraction, named after Poisson, who ridiculed the theory, especially its prediction of the existence of this spot[26] It is also called the Arago spot as François Arago observed it or the Fresnel bright spot after Augustin-Jean Fresnel's theory, though it had already been observed by Joseph-Nicolas Delisle and Giacomo F. Maraldi a century earlier.
- Prim's algorithm: the algorithm was developed in 1930, 27 years before Prim independently did, by the Czech mathematician Vojtěch Jarník.
- Prinzmetal angina: also known as variant angina, referring to angina (chest pain) caused by vasospasm of the coronary arteries. Described twice in the 1930s before being published by Prinzmetal in 1959.[27][28][29]
- Pythagorean theorem, named after the mathematician Pythagoras, although it was known before him to Babylonian mathematicians (although it is not known if the Babylonians possessed a proof of the result; yet it is not known either, whether Pythagoras proved the result).
R
- The Reynolds number in fluid mechanics was introduced by George Stokes, but is named after Osborne Reynolds, who popularized its use.
- Richards equation is attributed to Richards in his 1931 publication, but was earlier introduced by Richardson in 1922 in his book "Weather prediction by numerical process." (Cambridge University press. p. 262) as pointed out by John Knight and Peter Raats in "The contributions of Lewis Fry Richardson to drainage theory, soil physics, and the soil-plant-atmosphere continuum" EGU General Assembly 2016.
S
- The Sankey diagram was invented by Charles Joseph Minard
- The Schottky diode was neither discovered by Schottky nor its operation correctly explained by him. The actual nature of the metal–semiconductor junction was noted by Hans Bethe.
- Shuey's equation from 1985, which is an approximation of the Zoeprittz Equation first published in 1919.
- Simpson's paradox, a term introduced by Colin R. Blyth in 1972; but Edward Simpson did not actually discover this statistical paradox.
- The Simson line in geometry is named for Robert Simson, but cannot be found in Simson's works. Instead, it was first discovered by William Wallace in 1797.
- Snell's law of refraction, named after Willebrord Snellius, a Dutch scientist, also known as Descartes law of refraction (after René Descartes) was discovered by Ibn Sahl.
- the Snellius–Pothenot problem was solved by Willebrord Snellius only, and restated by Laurent Pothenot 75 years later
- Stigler's law, attributed by Stephen Stigler himself to Robert K. Merton, though the phenomenon had previously been noted by others.[30]
- Stirling's approximation, which was presaged in published work by Abraham de Moivre.
- Stokes's theorem discovered by Lord Kelvin
T
- The tetralogy of Fallot was described in 1672 by Niels Stensen, but named after Étienne-Louis Arthur Fallot who also described it in 1888.
- Taylor's law in ecology was discovered by H. Fairfield Smith in 1938 but named after L. R. Taylor who rediscovered it in 1961.
- Thévenin's theorem in circuit theory was discovered by Hermann von Helmholtz in 1853 but named after Léon Charles Thévenin who rediscovered it in 1883.
V
- Venn diagrams are named after John Venn, who popularized them in the 1880s, but Leonhard Euler had already introduced them in 1768.[31]
- Vigenère cipher was originally described by Giovan Battista Bellaso in his 1553 book La cifra del. Sig. Giovan Battista Bellaso, but later misattributed to Blaise de Vigenère in the 19th century.
- The Von Neumann architecture of computer hardware is misattributed to John von Neumann because he wrote a preliminary report called "First Draft of a Report on the EDVAC" that did not include the names of the inventors: John Mauchly and J. Presper Eckert
- Voronoi diagrams are named after Georgy Voronoy, who defined and studied the general n-dimensional case in 1908, but have already been used by Descartes (1644), Lejeune Dirichlet (1850) and Snow (1854).
W
- Wang tiles were hypothesized by Hao Wang not to exist, but an example was constructed by his student Robert Berger.
- Wheatstone bridge, an electrical measuring instrument invented by Samuel Hunter Christie in 1833, but named after Sir Charles Wheatstone who improved and popularized it in 1843.
- Widmanstätten patterns, named after Count Alois von Beckh Widmanstätten in 1808, but previously reported by William Thomson (mineralogist) in 1804.
- Wike's law of low odd primes, a principle of design of experiments, was stated by Sir Ronald A. Fisher in 1935 but named by Edwin Wike in 1973.
- Wilson Cycle, named in 1974 by Kevin C. A. Burke after the Canadian geologist J. Tuzo Wilson for Wilson's 1966 proposal that the Atlantic Ocean had previously closed and then opened again, a theory that the Swiss geologist Émile Argand had proposed in the 1920s.
Y
- Yagi–Uda antenna, a successful and popular beam antenna, whose primary inventor was Shintaro Uda, but which was popularized by, and formerly popularly named for, his collaborator Hidetsugu Yagi.
Z
- Zipf's law states that given some corpus of natural language utterances, the frequency of any word is inversely proportional to its rank in the frequency table. The law is named after George Kingsley Zipf, an early twentieth century American linguist. Zipf popularized Zipf's law and sought to explain it, though he did not claim to have originated it.[32]
See also
References
- "Bessemer process". Encyclopædia Britannica. 2. 2005. p. 168.
- "Kelly, William". Encyclopædia Britannica. 6. 2005. p. 791.
- Bonferroni, C. E., Teoria statistica delle classi e calcolo delle probabilità, Pubblicazioni del R Istituto Superiore di Scienze Economiche e Commerciali di Firenze 1936
- Dunn, Olive Jean (1958). "Estimation of the Means for Dependent Variables". Annals of Mathematical Statistics. 29 (4): 1095–1111. doi:10.1214/aoms/1177706374. JSTOR 2237135.
- Dunn, Olive Jean (1961). "Multiple Comparisons Among Means" (PDF). Journal of the American Statistical Association. 56 (293): 52–64. CiteSeerX 10.1.1.309.1277. doi:10.1080/01621459.1961.10482090.
- Heath, I. "Unacceptable File Operations in a Relational Database." Proc. 1971 ACM SIGFIDET Workshop on Data Description, Access, and Control, San Diego, California (November 11–12, 1971).
- Date, C.J. Database in Depth: Relational Theory for Practitioners. O'Reilly (2005), p. 142.
- Lemmermeyer, F. (2013). "Václav Šimerka: quadratic forms and factorization". LMS Journal of Computation and Mathematics. 16: 118–129. doi:10.1112/S1461157013000065.
- "Scipione Ferro | Italian mathematician".
- J. Stillwell, Mathematics and Its History, 3rd Ed, Springer,2010
- André Baranne and Françoise Launay, Cassegrain: a famous unknown of instrumental astronomy, Journal of Optics, 1997, vol. 28, no. 4, pp. 158-172(15)
- Stargazer, the Life and Times of the Telescope, by Fred Watson, p. 134
- Stargazer, p. 115.
- Mercer, Christia (25 September 2017). "Opinion | Descartes is Not Our Father". The New York Times.
- Chernoff, Herman (2014). "A career in statistics" (PDF). In Lin, Xihong; Genest, Christian; Banks, David L.; Molenberghs, Geert; Scott, David W.; Wang, Jane-Ling (eds.). Past, Present, and Future of Statistics. CRC Press. p. 35. ISBN 9781482204964.
- Grimmett, Geoffrey (2006). "Random‑Cluster Measures". The Random‑Cluster Model. Grundlehren der Mathematischen Wissenschaften. Springer. 333: 6. doi:10.1007/978-3-540-32891-9_1. ISBN 978-3-540-32891-9. ISSN 0072-7830. LCCN 2006925087. OCLC 262691034. OL 4105561W. Archived (PDF) from the original on 2016-02-13.
There is a critical temperature for this phenomenon, often called the Curie point after Pierre Curie, who reported this discovery in his 1895 thesis ... In an example of Stigler’s Law ... the existence of such a temperature was discovered before 1832 by [Claude] Pouillet....
- Stargazer, the Life and Times of the Telescope, by Fred Watson, p. 134
- Stargazer, p. 115.
- Hodrick, Robert, and Edward C. Prescott (1997), "Postwar U.S. Business Cycles: An Empirical Investigation," Journal of Money, Credit, and Banking, 29 (1), 1–16.
- Whittaker, E. T. (1923): On a new method of graduation, Proceedings of the Edinburgh Mathematical Association, 78, 81–89 – as quoted in Philips 2010
- E.B.Saff and A.D. Snider, Fundamentals of Complex Analysis, 3rd Ed. Prentice Hall, 2003
- Cf. Clifford A. Pickover, De Arquímides a Hawking,p. 137
- PhD-Design Discussion List, 7 January 2013, https://www.jiscmail.ac.uk/cgi-bin/webadmin?A2=ind1301&L=phd-design&D=0&P=11022
- [Analyse Mathematique. Sure Les Probabilties des Erreurs de Situation d'un Point Mem. Acad. Roy. Sei. Inst. France, Sci. Math, et Phys., t. 9, p. 255-332. 1846]
- [Wright, S., 1921. Correlation and causation. Journal of agricultural research, 20(7), pp.557-585]
- Physics, Robert Resnick, David Halliday, Kenneth S. Krane. volume 4, 4th edition, chapter 46
- Parkinson, J, Bedford, DE. Electrocardiographic changes during brief attacks of angina pectoris. Lancet 1931; 1:15.
- Brow, GR, Holman, DV. Electrocardiographic study during a paroxysm of angina pectoris. Am Heart J 1933; 9:259.
- Prinzmetal, M, Kennamer, R, Merliss, R, et al. A variant form of angina pectoris. Preliminary report. Am Heart J 1959; 27:375.
- For example Henry Dudeney noted in his 1917 Amusements in Mathematics solution 129 that Pell's equation was called that "apparently because Pell neither first propounded the question nor first solved it!"
- Grattan-Guinness, Ivor (1997): The Rainbow of Mathematics, pp. 563–564. New York, W. W. Norton.
- Powers, David M W (1998). "Applications and explanations of Zipf's law". Association for Computational Linguistics: 151–160. Cite journal requires
|journal=(help)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.