|
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. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stigler's Law Of Eponymy
Stigler's law of eponymy, proposed by University of Chicago statistics professor Stephen Stigler in his 1980 publication ''Stigler’s law of eponymy'', states that no scientific discovery is named after its original discoverer. Examples include Hubble's law, which was derived by Georges Lemaître two years before Edwin Hubble, the Pythagorean theorem, which was known to Babylonian mathematicians before Pythagoras, and Halley's Comet, which was observed by astronomers since at least 240 BC (although its official designation is due to the first ever mathematical prediction of such astronomical phenomenon in the sky, not to its discovery). Stigler himself named the sociologist Robert K. Merton as the discoverer of "Stigler's law" to show that it follows its own decree, though the phenomenon had previously been noted by others. Derivation Historical acclaim for discoveries is often assigned to persons of note who bring attention to an idea that is not yet widely known, whethe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simon Plouffe
Simon Plouffe (born June 11, 1956) is a mathematician who discovered the Bailey–Borwein–Plouffe formula (BBP algorithm) which permits the computation of the ''n''th binary digit of π, in 1995. His other 2022 formula allows extracting the ''n''th digit of in decimal. He was born in Saint-Jovite, Quebec. He co-authored ''The Encyclopedia of Integer Sequences'', made into the web site On-Line Encyclopedia of Integer Sequences dedicated to integer sequences later in 1995. In 1975, Plouffe broke the world record for memorizing digits of π by reciting 4096 digits, a record which stood until 1977. See also *Fabrice Bellard, who discovered in 1997 a faster formula to compute pi. *PiHex PiHex was a distributed computing project organized by Colin Percival to calculate specific bits of . 1,246 contributors used idle time slices on almost two thousand computers to make its calculations. The software used for the project made use of ... Notes External links * * Plouffe websit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bessemer Process
The Bessemer process was the first inexpensive industrial process for the mass production of steel from molten pig iron before the development of the open hearth furnace. The key principle is removal of impurities from the iron by oxidation with air being blown through the molten iron. The oxidation also raises the temperature of the iron mass and keeps it molten. Related decarburizing with air processes had been used outside Europe for hundreds of years, but not on an industrial scale. One such process (similar to puddling) was known in the 11th century in East Asia, where the scholar Shen Kuo of that era described its use in the Chinese iron and steel industry. In the 17th century, accounts by European travelers detailed its possible use by the Japanese. The modern process is named after its inventor, the Englishman Henry Bessemer, who took out a patent on the process in 1856. The process was said to be independently discovered in 1851 by the American inventor William Ke ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Désiré André
Désiré André (André Antoine Désiré) (March 29, 1840, Lyon – September 12, 1917, Paris) was a French mathematician, best known for his work on Catalan numbers and alternating permutations. Biography He is the son of Auguste Antoine Désiré André, shoemaker in Lyon, and his wife Antoinette Magdalene Jar. He entered the École Normale Supérieure in 1860 and passed the Agrégation in Mathematics in 1863. He defended his doctoral thesis on 25 March 1877. He was a student of Charles Hermite (1822–1901) and Joseph Bertrand (1822–1900). Starting as a teacher at the Lycée de Troyes, he went on to Collège Sainte-Barbe, then to the University of Dijon and finally became professor of mathematics at Collège Stanislas de Paris from 1885 to 1900. He was a laureate of the Ministère de l'Instruction Publique, member of the Circolo Matematico di Palermo and the Commission Internationale Permanente de Bibliographie Mathématique. He was made a Knight of the Legion of Honour i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Joseph Louis François Bertrand
Joseph Louis François Bertrand (; 11 March 1822 – 5 April 1900) was a French mathematician who worked in the fields of number theory, differential geometry, probability theory, economics and thermodynamics. Biography Joseph Bertrand was the son of physician Alexandre Jacques François Bertrand and the brother of archaeologist Alexandre Bertrand. His father died when Joseph was only nine years old, but that did not stand in his way of learning and understanding algebraic and elementary geometric concepts, and he also could speak Latin fluently, all when he was of the same age of nine. At eleven years old he attended the course of the École Polytechnique as an auditor (open courses). From age eleven to seventeen, he obtained two bachelor's degrees, a license and a PhD with a thesis on the mathematical theory of electricity and is admitted first to the 1839 entrance examination of the École Polytechnique. Bertrand was a professor at the École Polytechnique and Collège de Fra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
William Allen Whitworth
William Allen Whitworth (1 February 1840 – 12 March 1905) was an English mathematician and a priest in the Church of England.. Education and mathematical career Whitworth was born in Runcorn; his father, William Whitworth, was a school headmaster, and he was the oldest of six siblings. He was schooled at the Sandicroft School in Northwich and then at St John's College, Cambridge, earning a B.A. in 1862 as 16th Wrangler. He taught mathematics at the Portarlington School and the Rossall School, and was a professor of mathematics at Queen's College in Liverpool from 1862 to 1864. He returned to Cambridge to earn a master's degree in 1865, and was a fellow there from 1867 to 1882. Mathematical contributions As an undergraduate, Whitworth became the founding editor in chief of the '' Messenger of Mathematics'', and he continued as its editor until 1880. He published works about the logarithmic spiral and about trilinear coordinates, but his most famous mathematical publication is the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
André's Reflection Method
In combinatorics, Bertrand's ballot problem is the question: "In an election where candidate A receives ''p'' votes and candidate B receives ''q'' votes with ''p'' > ''q'', what is the probability that A will be strictly ahead of B throughout the count?" The answer is :\frac. The result was first published by W. A. Whitworth in 1878, but is named after Joseph Louis François Bertrand who rediscovered it in 1887. In Bertrand's original paper, he sketches a proof based on a general formula for the number of favourable sequences using a recursion relation. He remarks that it seems probable that such a simple result could be proved by a more direct method. Such a proof was given by Désiré André, based on the observation that the unfavourable sequences can be divided into two equally probable cases, one of which (the case where B receives the first vote) is easily computed; he proves the equality by an explicit bijection. A variation of his method is popularly know ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Simon Newcomb
Simon Newcomb (March 12, 1835 – July 11, 1909) was a Canadian– American astronomer, applied mathematician, and autodidactic polymath. He served as Professor of Mathematics in the United States Navy and at Johns Hopkins University. Born in Nova Scotia, at the age of 19 Newcomb left an apprenticeship to join his father in Massachusetts, where the latter was teaching. Though Newcomb had little conventional schooling, he completed a BSc at Harvard in 1858. He later made important contributions to timekeeping, as well as to other fields in applied mathematics, such as economics and statistics. Fluent in several languages, he also wrote and published several popular science books and a science fiction novel. Biography Early life Simon Newcomb was born in the town of Wallace, Nova Scotia. His parents were John Burton Newcomb and his wife Miriam Steeves. His father was an itinerant school teacher, and frequently moved in order to teach in different parts of Canada, particularly ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Frank Benford
Frank Albert Benford Jr. (July 10, 1883 – December 4, 1948) was an American electrical engineer and physicist best known for rediscovering and generalizing Benford's Law, a statistical statement about the occurrence of digits in lists of data. (subscription required) Benford is also known for having devised, in 1937, an instrument for measuring the refractive index of glass. An expert in optical measurements, he published 109 papers in the fields of optics and mathematics and was granted 20 patents on optical devices. Early life He was born in Johnstown, Pennsylvania. His date of birth is given variously as May 29 or July 10, 1883. At the age of 6 his family home was destroyed by the Johnstown Flood. Education He graduated from the University of Michigan in 1910. Career Benford worked for General Electric General Electric Company (GE) is an American multinational conglomerate founded in 1892, and incorporated in New York state and headquartered in Boston. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Benford's Law
Benford's law, also known as the Newcomb–Benford law, the law of anomalous numbers, or the first-digit law, is an observation that in many real-life sets of numerical data, the leading digit is likely to be small.Arno Berger and Theodore P. HillBenford's Law Strikes Back: No Simple Explanation in Sight for Mathematical Gem 2011. In sets that obey the law, the number 1 appears as the leading significant digit about 30% of the time, while 9 appears as the leading significant digit less than 5% of the time. If the digits were distributed uniformly, they would each occur about 11.1% of the time. Benford's law also makes predictions about the distribution of second digits, third digits, digit combinations, and so on. The graph to the right shows Benford's law for base 10, one of infinitely many cases of a generalized law regarding numbers expressed in arbitrary (integer) bases, which rules out the possibility that the phenomenon might be an artifact of the base-10 number system ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bellman–Ford Algorithm
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. The algorithm was first proposed by , but is instead named after Richard Bellman and Lester Ford Jr., who published it in 1958 and 1956, respectively. Edward F. Moore also published a variation of the algorithm in 1959, and for this reason it is also sometimes called the Bellman–Ford–Moore algorithm. Negative edge weights are found in various applications of graphs, hence the usefulness of this algorithm. If a graph contains a "negative cycle" (i.e. a cycle whose edges sum to a negative value) that is reachable from the source, then there is no ''cheapest'' path: any path that has a point on the negative cycle can be made cheaper by one more walk ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
