Benito Mussolini

The Mathematics Portal

Mathematics is the study of representing and reasoning about abstract objects (such as numbers, points, spaces, sets, structures, and games). Mathematics is used throughout the world as an essential tool in many fields, including natural science, engineering, medicine, and the social sciences. Applied mathematics, the branch of mathematics concerned with application of mathematical knowledge to other fields, inspires and makes use of new mathematical discoveries and sometimes leads to the development of entirely new mathematical disciplines, such as statistics and game theory. Mathematicians also engage in pure mathematics, or mathematics for its own sake, without having any application in mind. There is no clear line separating pure and applied mathematics, and practical applications for what began as pure mathematics are often discovered. (Full article...)

Refresh with new selections below (purge)

Featured articles – load new batch

Featured articles are displayed here, which represent some of the best content on English Wikipedia.

Image 1

Portrait, c. 1910, after 1620 original

Johannes Kepler (27 December 1571 – 15 November 1630) was a German polymath who was an astronomer, mathematician, astrologer, natural philosopher and music theorist. He is a key figure in the 17th-century Scientific Revolution, best known for his laws of planetary motion, and his books Astronomia nova, Harmonice Mundi, and Epitome Astronomiae Copernicanae. The variety and impact of his work made Kepler one of the founders and fathers of modern astronomy, the scientific method, natural science, and modern science. He has been described as the "father of science fiction" for his novel Somnium.

Kepler was a mathematics teacher at a seminary school in Graz, where he became an associate of Prince Hans Ulrich von Eggenberg. Later he became an assistant to the astronomer Tycho Brahe in Prague, and eventually the imperial mathematician to Emperor Rudolf II and his two successors Matthias and Ferdinand II. He also taught mathematics in Linz, and was an adviser to General Wallenstein. (Full article...)
Image 2
Figure 1: A solution (in purple) to Apollonius's problem. The given circles are shown in black.

In Euclidean plane geometry, the problem of Apollonius (also called Apollonius's problem or the Apollonian problem) is to construct circles that are tangent to three given circles in a plane (Figure 1). Apollonius of Perga (c. 262 BC – c. 190 BC) posed and solved this famous problem in his work Ἐπαφαί (Epaphaí, 'Tangencies'); this work has been lost, but a 4th-century AD report of his results by Pappus of Alexandria has survived. Three given circles generically have eight different circles that are tangent to them (Figure 2), a pair of solutions for each way to divide the three given circles in two subsets (there are 4 ways to divide a set of cardinality 3 in 2 parts).

In the 16th century, Adriaan van Roomen solved the problem using intersecting hyperbolas, but this solution uses methods not limited to straightedge and compass constructions. François Viète found a straightedge and compass solution by exploiting limiting cases: any of the three given circles can be shrunk to zero radius (a point) or expanded to infinite radius (a line). Viète's approach, which uses simpler limiting cases to solve more complicated ones, is considered a plausible reconstruction of Apollonius's method. The method of van Roomen was simplified by Isaac Newton, who showed that Apollonius's problem is equivalent to finding a position from the differences of its distances to three known points. This has applications in navigation and positioning systems such as LORAN. (Full article...)
Image 3

Cantor, c. 1910

Georg Ferdinand Ludwig Philipp Cantor (/ˈkæntɔːr/ KAN-tor; German: [ˈɡeːɔʁk ˈfɛʁdinant ˈluːtvɪç ˈfɪlɪp ˈkantoːɐ̯]; 3 March [O.S. 19 February] 1845 – 6 January 1918) was a mathematician who played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between the members of two sets, defined infinite and well-ordered sets, and proved that the real numbers are more numerous than the natural numbers. Cantor's method of proof of this theorem implies the existence of an infinity of infinities. He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact of which he was well aware.

Originally, Cantor's theory of transfinite numbers was regarded as counter-intuitive – even shocking. This caused it to encounter resistance from mathematical contemporaries such as Leopold Kronecker and Henri Poincaré and later from Hermann Weyl and L. E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections; see Controversy over Cantor's theory. Cantor, a devout Lutheran Christian, believed the theory had been communicated to him by God. Some Christian theologians (particularly neo-Scholastics) saw Cantor's work as a challenge to the uniqueness of the absolute infinity in the nature of God – on one occasion equating the theory of transfinite numbers with pantheism – a proposition that Cantor vigorously rejected. Not all theologians were against Cantor's theory; prominent neo-scholastic philosopher Konstantin Gutberlet [de; it] was in favor of it, and Cardinal Johann Baptist Franzelin accepted it as a valid theory (after Cantor made some important clarifications). (Full article...)
Image 4

Damage from Hurricane Katrina in 2005. Actuaries need to estimate long-term levels of such damage in order to accurately price property insurance, set appropriate reserves, and design appropriate reinsurance and capital management strategies.

An actuary is a professional with advanced mathematical skills who deals with the measurement and management of risk and uncertainty. These risks can affect both sides of the balance sheet and require asset management, liability management, and valuation skills. Actuaries provide assessments of financial security systems, with a focus on their complexity, their mathematics, and their mechanisms. The name of the corresponding academic discipline is actuarial science.

While the concept of insurance dates to antiquity, the concepts needed to scientifically measure and mitigate risks have their origins in 17th-century studies of probability and annuities. Actuaries in the 21st century require analytical skills, business knowledge, and an understanding of human behavior and information systems; actuaries use this knowledge to design programs that manage risk, by determining if the implementation of strategies proposed for mitigating potential risks does not exceed the expected cost of those risks actualized. The steps needed to become an actuary, including education and licensing, are specific to a given country, with various additional requirements applied by regional administrative units; however, almost all processes impart universal principles of risk assessment, statistical analysis, and risk mitigation, involving rigorously structured training and examination schedules, taking many years to complete. (Full article...)
Image 5
In algebraic geometry and theoretical physics, mirror symmetry is a relationship between geometric objects called Calabi–Yau manifolds. The term refers to a situation where two Calabi–Yau manifolds look very different geometrically but are nevertheless equivalent when employed as extra dimensions of string theory.

Early cases of mirror symmetry were discovered by physicists. Mathematicians became interested in this relationship around 1990 when Philip Candelas, Xenia de la Ossa, Paul Green, and Linda Parkes showed that it could be used as a tool in enumerative geometry, a branch of mathematics concerned with counting the number of solutions to geometric questions. Candelas and his collaborators showed that mirror symmetry could be used to count rational curves on a Calabi–Yau manifold, thus solving a longstanding problem. Although the original approach to mirror symmetry was based on physical ideas that were not understood in a mathematically precise way, some of its mathematical predictions have since been proven rigorously. (Full article...)
Image 6

Richard Phillips Feynman (/ˈfaɪnmən/; May 11, 1918 – February 15, 1988) was an American theoretical physicist. He shared the 1965 Nobel Prize in Physics with Julian Schwinger and Shin'ichirō Tomonaga "for their fundamental work in quantum electrodynamics (QED), with deep-ploughing consequences for the physics of elementary particles".
He is also known for his work in the path integral formulation of quantum mechanics, the theory of the physics of the superfluidity of supercooled liquid helium, and the parton model. Feynman developed a pictorial representation scheme for the mathematical expressions describing the behavior of subatomic particles, which later became known as Feynman diagrams and remains widely used.

He assisted in the development of the atomic bomb during World War II and became known to the wider public in the 1980s as a member of the Rogers Commission, the panel that investigated the Space Shuttle Challenger disaster. Along with his work in theoretical physics, Feynman has been credited with having pioneered the field of quantum computing and introducing the concept of nanotechnology. He held the Richard C. Tolman professorship in theoretical physics at the California Institute of Technology. In a 1999 poll of 130 leading physicists worldwide by the British journal Physics World, he was ranked the seventh-greatest physicist of all time. (Full article...)
Image 7
General relativity, also known as the general theory of relativity, and as Einstein's theory of gravity, is the geometric theory of gravitation published by Albert Einstein in May 1916 and is the accepted description of the gravitation of macroscopic objects in modern physics. General relativity generalizes special relativity and refines Isaac Newton's law of universal gravitation, providing a unified description of gravity as a geometric property of space and time, or four-dimensional spacetime. In particular, the curvature of spacetime is directly related to the energy, momentum, and stress of whatever is present, including matter and radiation. The relation is specified by the Einstein field equations, a system of second-order partial differential equations. John Archibald Wheeler summarized it: "Space-time tells matter how to move; matter tells space-time how to curve."

Newton's law of universal gravitation, which describes gravity in classical mechanics, can be seen as a prediction of general relativity for the almost flat spacetime geometry around stationary mass distributions. Some predictions of general relativity, however, are beyond Newton's law of universal gravitation in classical physics. These predictions concern the passage of time, the geometry of space, the motion of bodies in free fall, and the propagation of light, and include gravitational time dilation, gravitational lensing, the gravitational redshift of light, the Shapiro time delay, singularities and black holes. So far, all tests of general relativity have been in agreement with the theory. The time-dependent solutions of general relativity enable us to extrapolate the history of the universe into the past and future, and have provided the modern framework for cosmology, thus leading to the discovery of the Big Bang and cosmic microwave background radiation. Despite the introduction of a number of alternative theories, general relativity continues to be the simplest theory consistent with experimental data. (Full article...)
Image 8
The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group $S̃ 3$

The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects. In addition to this geometric description, the affine symmetric groups may be defined in other ways: as collections of permutations (rearrangements) of the integers ( $..., - 2, - 1, 0, 1, 2, ...$ ) that are periodic in a certain sense, or in purely algebraic terms as a group with certain generators and relations. They are studied in combinatorics and representation theory.

A finite symmetric group consists of all permutations of a finite set. Each affine symmetric group is an infinite extension of a finite symmetric group. Many important combinatorial properties of the finite symmetric groups can be extended to the corresponding affine symmetric groups. Permutation statistics such as descents and inversions can be defined in the affine case. As in the finite case, the natural combinatorial definitions for these statistics also have a geometric interpretation. (Full article...)
$Image 9 1753 portraitLeonhard Euler (/ˈɔɪlər/ OY-lər; 15 April 1707 – 18 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, music theorist and engineer. He founded the studies of graph theory and topology and made influential discoveries in many other branches of mathematics, such as analytic number theory, complex analysis, and infinitesimal calculus. He also introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is known for his work in mechanics, fluid dynamics, optics, astronomy, and music theory. Euler has been called a "universal genius" who "was fully equipped with almost unlimited powers of imagination, intellectual gifts and extraordinary memory". He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia.Euler is credited for popularizing the Greek letter π {\displaystyle \pi } (lowercase pi) to denote the ratio of a circle's circumference to its diameter, as well as first using the notation f ( x ) {\displaystyle f(x)} for the value of a function, the letter i {\displaystyle i} to express the imaginary unit − 1 {\displaystyle {\sqrt {-1}}} , the Greek letter Σ {\displaystyle \Sigma } (capital sigma) to express summations, the Greek letter Δ {\displaystyle \Delta } (capital delta) for finite differences, and lowercase letters to represent the sides of a triangle while representing the angles as capital letters. He gave the current definition of the constant e {\displaystyle e} , the base of the natural logarithm, now known as Euler's number. Euler made contributions to applied mathematics and engineering, such as his study of ships helping navigation, his three volumes on optics, which contributed to the design of microscopes and telescopes, and his studies of beam bending and column critical loads. (Full article...)$
Image 9

1753 portrait

Leonhard Euler (/ˈɔɪlər/ OY-lər; 15 April 1707 – 18 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, music theorist and engineer. He founded the studies of graph theory and topology and made influential discoveries in many other branches of mathematics, such as analytic number theory, complex analysis, and infinitesimal calculus. He also introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is known for his work in mechanics, fluid dynamics, optics, astronomy, and music theory. Euler has been called a "universal genius" who "was fully equipped with almost unlimited powers of imagination, intellectual gifts and extraordinary memory". He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia.

Euler is credited for popularizing the Greek letter $\pi$ (lowercase pi) to denote the ratio of a circle's circumference to its diameter, as well as first using the notation $f(x)$ for the value of a function, the letter $i$ to express the imaginary unit ${\sqrt {-1}}$ , the Greek letter $\Sigma$ (capital sigma) to express summations, the Greek letter $\Delta$ (capital delta) for finite differences, and lowercase letters to represent the sides of a triangle while representing the angles as capital letters. He gave the current definition of the constant $e$ , the base of the natural logarithm, now known as Euler's number. Euler made contributions to applied mathematics and engineering, such as his study of ships helping navigation, his three volumes on optics, which contributed to the design of microscopes and telescopes, and his studies of beam bending and column critical loads. (Full article...)
Image 10

Josiah Willard Gibbs (/ɡɪbz/; February 11, 1839 – April 28, 1903) was an American mechanical engineer and scientist who made fundamental theoretical contributions to physics, chemistry, and mathematics. His work on the applications of thermodynamics was instrumental in transforming physical chemistry into a rigorous deductive science. Together with James Clerk Maxwell and Ludwig Boltzmann, he created statistical mechanics (a term that he coined), explaining the laws of thermodynamics as consequences of the statistical properties of ensembles of the possible states of a physical system composed of many particles. Gibbs also worked on the application of Maxwell's equations to problems in physical optics. As a mathematician, he created modern vector calculus (independently of the British scientist Oliver Heaviside, who carried out similar work during the same period) and described the Gibbs phenomenon in the theory of Fourier analysis.

In 1863, Yale University awarded Gibbs the first American doctorate in engineering. After a three-year sojourn in Europe, Gibbs spent the rest of his career at Yale, where he was a professor of mathematical physics from 1871 until his death in 1903. Working in relative isolation, he became the earliest theoretical scientist in the United States to earn an international reputation and was praised by Albert Einstein as "the greatest mind in American history". In 1901, Gibbs received what was then considered the highest honor awarded by the international scientific community, the Copley Medal of the Royal Society of London, "for his contributions to mathematical physics". (Full article...)
$Image 11Logic studies valid forms of inference like modus ponens.Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics.Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to work." Premises and conclusions express propositions or claims that can be true or false. An important feature of propositions is their internal structure. For example, complex propositions are made up of simpler propositions linked by logical vocabulary like ∧ {\displaystyle \land } (and) or → {\displaystyle \to } (if...then). Simple propositions also have parts, like "Sunday" or "work" in the example. The truth of a proposition usually depends on the meanings of all of its parts. However, this is not the case for logically true propositions. They are true only because of their logical structure independent of the specific meanings of the individual parts. (Full article...)$
Image 11
Logic studies valid forms of inference like modus ponens.

Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics.

Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to work." Premises and conclusions express propositions or claims that can be true or false. An important feature of propositions is their internal structure. For example, complex propositions are made up of simpler propositions linked by logical vocabulary like $\land$ (and) or $\to$ (if...then). Simple propositions also have parts, like "Sunday" or "work" in the example. The truth of a proposition usually depends on the meanings of all of its parts. However, this is not the case for logically true propositions. They are true only because of their logical structure independent of the specific meanings of the individual parts. (Full article...)
$Image 12The first 15,000 partial sums of 0 + 1 − 2 + 3 − 4 + ... The graph is situated with positive integers to the right and negative integers to the left.In mathematics, 1 − 2 + 3 − 4 + ··· is an infinite series whose terms are the successive positive integers, given alternating signs. Using sigma summation notation the sum of the first m terms of the series can be expressed as ∑ n = 1 m n ( − 1 ) n − 1 . {\displaystyle \sum _{n=1}^{m}n(-1)^{n-1}.} The infinite series diverges, meaning that its sequence of partial sums, (1, −1, 2, −2, 3, ...), does not tend towards any finite limit. Nonetheless, in the mid-18th century, Leonhard Euler wrote what he admitted to be a paradoxical equation: 1 − 2 + 3 − 4 + ⋯ = 1 4 . {\displaystyle 1-2+3-4+\cdots ={\frac {1}{4}}.} (Full article...)$
Image 12
The first 15,000 partial sums of 0 + 1 − 2 + 3 − 4 + ... The graph is situated with positive integers to the right and negative integers to the left.

In mathematics, 1 − 2 + 3 − 4 + ··· is an infinite series whose terms are the successive positive integers, given alternating signs. Using sigma summation notation the sum of the first m terms of the series can be expressed as
$\sum _{n=1}^{m}n(-1)^{n-1}.$

The infinite series diverges, meaning that its sequence of partial sums, (1, −1, 2, −2, 3, ...), does not tend towards any finite limit. Nonetheless, in the mid-18th century, Leonhard Euler wrote what he admitted to be a paradoxical equation:
$1-2+3-4+\cdots ={\frac {1}{4}}.$ (Full article...)
$Image 13Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300).In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).It is an example of an algorithm, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)$
Image 13
Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300).

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).
It is an example of an algorithm, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, $21$ is the GCD of $252$ and $105$ (as $252 = 21 \times 12$ and $105 = 21 \times 5)$ , and the same number $21$ is also the GCD of $105$ and $252 - 105 = 147$ . Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, $21 = 5 \times 105 + (-2) \times 252$ ). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)
Image 14
The weighing pans of this balance scale contain zero objects, divided into two equal groups.

In mathematics, zero is an even number. In other words, its parity—the quality of an integer being even or odd—is even. This can be easily verified based on the definition of "even": zero is an integer multiple of 2, specifically 0 × 2. As a result, zero shares all the properties that characterize even numbers: for example, 0 is neighbored on both sides by odd numbers, any decimal integer has the same parity as its last digit—so, since 10 is even, 0 will be even, and if $y$ is even then $y + x$ has the same parity as $x$ —indeed, $0 + x$ and $x$ always have the same parity.

Zero also fits into the patterns formed by other even numbers. The parity rules of arithmetic, such as even − even = even, require 0 to be even. Zero is the additive identity element of the group of even integers, and it is the starting case from which other even natural numbers are recursively defined. Applications of this recursion from graph theory to computational geometry rely on zero being even. Not only is 0 divisible by 2, it is divisible by every power of 2, which is relevant to the binary numeral system used by computers. In this sense, 0 is the "most even" number of all. (Full article...)
Image 15

Noether c. 1900–1910

Amalie Emmy Noether (23 March 1882 – 14 April 1935) was a German mathematician who made many important contributions to abstract algebra. She also proved Noether's first and second theorems, which are fundamental in mathematical physics. Noether was described by Pavel Alexandrov, Albert Einstein, Jean Dieudonné, Hermann Weyl, and Norbert Wiener as the most important woman in the history of mathematics. As one of the leading mathematicians of her time, she developed theories of rings, fields, and algebras. In physics, Noether's theorem explains the connection between symmetry and conservation laws.

Noether was born to a Jewish family in the Franconian town of Erlangen; her father was the mathematician Max Noether. She originally planned to teach French and English after passing the required examinations, but instead studied mathematics at the University of Erlangen–Nuremberg, where her father lectured. After completing her doctorate in 1907 under the supervision of Paul Gordan, she worked at the Mathematical Institute of Erlangen without pay for seven years. At the time, women were largely excluded from academic positions. In 1915, David Hilbert and Felix Klein invited her to join the mathematics department at the University of Göttingen, a world-renowned center of mathematical research. The philosophical faculty objected, and she spent four years lecturing under Hilbert's name. Her habilitation was approved in 1919, allowing her to obtain the rank of Privatdozent. (Full article...)

More featured articles

Selected image – show another

Sieve of Eratosthenes

Credit: M.qrius

The sieve of Eratosthenes is a simple algorithm for finding all prime numbers up to a specified maximum value. It works by identifying the prime numbers in increasing order while removing from consideration composite numbers that are multiples of each prime. This animation shows the process of finding all primes no greater than 120. The algorithm begins by identifying 2 as the first prime number and then crossing out every multiple of 2 up to 120. The next available number, 3, is the next prime number, so then every multiple of 3 is crossed out. (In this version of the algorithm, 6 is not crossed out again since it was just identified as a multiple of 2. The same optimization is used for all subsequent steps of the process: given a prime

p

, only multiples no less than

p 2

are considered for crossing out, since any lower multiples must already have been identified as multiples of smaller primes. Larger multiples that just happen to already be crossed out—like 12 when considering multiples of 3—are crossed out again, because checking for such duplicates would impose an unnecessary speed penalty on any real-world implementation of the algorithm.) The next remaining number, 5, is the next prime, so its multiples get crossed out (starting with 25); and so on. The process continues until no more composite numbers could possibly be left in the list (i.e., when the square of the next prime exceeds the specified maximum). The remaining numbers (here starting with 11) are all prime. Note that this procedure is easily extended to find primes in any given arithmetic progression. One of several prime number sieves, this ancient algorithm was attributed to the Greek mathematician Eratosthenes (d. c. 194 BCE) by Nicomachus in his first-century (CE) work Introduction to Arithmetic. Other more modern sieves include the sieve of Sundaram (1934) and the sieve of Atkin (2003). The main benefit of sieve methods is the avoidance of costly primality tests (or, conversely, divisibility tests). Their main drawback is their restriction to specific ranges of numbers, which makes this type of method inappropriate for applications requiring very large prime numbers, such as public-key cryptography.

More selected pictures

Good articles – load new batch

These are Good articles, which meet a core set of high editorial standards.

Image 1
17 indivisible camels

The 17-animal inheritance puzzle is a mathematical puzzle involving unequal but fair allocation of indivisible goods, usually stated in terms of inheritance of a number of large animals (17 camels, 17 horses, 17 elephants, etc.) which must be divided in some stated proportion among a number of beneficiaries. It is a common example of an apportionment problem.

Despite often being framed as a puzzle, it is more an anecdote about a curious calculation than a problem with a clear mathematical solution. Beyond recreational mathematics and mathematics education, the story has been repeated as a parable with varied metaphorical meanings. (Full article...)
Image 2
Mathematical economics is the application of mathematical methods to represent theories and analyze problems in economics. Often, these applied methods are beyond simple geometry, and may include differential and integral calculus, difference and differential equations, matrix algebra, mathematical optimization, or other computational methods. Proponents of this approach claim that it allows the formulation of theoretical relationships with rigor, generality, and simplicity.

Mathematics allows economists to form meaningful, testable propositions about wide-ranging and complex subjects that would be less easily expressed informally. Further, the language of mathematics allows economists to make specific, positive claims about controversial subjects that would be impossible without it. Much of economic theory is currently presented in terms of mathematical economic models, a set of stylized and simplified mathematical relationships asserted to clarify assumptions and implications. (Full article...)
Image 3
In number theory, a Wieferich prime is a prime number p such that p² divides $2 p - 1 - 1$ , therefore connecting these primes with Fermat's little theorem, which states that every odd prime p divides $2 p - 1 - 1$ . Wieferich primes were first described by Arthur Wieferich in 1909 in works pertaining to Fermat's Last Theorem, at which time both of Fermat's theorems were already well known to mathematicians.

Since then, connections between Wieferich primes and various other topics in mathematics have been discovered, including other types of numbers and primes, such as Mersenne and Fermat numbers, specific types of pseudoprimes and some types of numbers generalized from the original definition of a Wieferich prime. Over time, those connections discovered have extended to cover more properties of certain prime numbers as well as more general subjects such as number fields and the abc conjecture. (Full article...)
$Image 4Translation of an English sentence to first-order logicLogic translation is the process of representing a text in the formal language of a logical system. If the original text is formulated in ordinary language then the term natural language formalization is often used. An example is the translation of the English sentence "some men are bald" into first-order logic as ∃ x ( M ( x ) ∧ B ( x ) ) {\displaystyle \exists x(M(x)\land B(x))} . The purpose is to reveal the logical structure of arguments. This makes it possible to use the precise rules of formal logic to assess whether these arguments are correct. It can also guide reasoning by arriving at new conclusions. Many of the difficulties of the process are caused by vague or ambiguous expressions in natural language. For example, the English word "is" can mean that something exists, that it is identical to something else, or that it has a certain property. This contrasts with the precise nature of formal logic, which avoids such ambiguities. Natural language formalization is relevant to various fields in the sciences and humanities. It may play a key role for logic in general since it is needed to establish a link between many forms of reasoning and abstract logical systems. The use of informal logic is an alternative to formalization since it analyzes the cogency of ordinary language arguments in their original form. Natural language formalization is distinguished from logic translations that convert formulas from one logical system into another, for example, from modal logic to first-order logic. This form of logic translation is specifically relevant for logic programming and metalogic. (Full article...)$
Image 4
Translation of an English sentence to first-order logic

Logic translation is the process of representing a text in the formal language of a logical system. If the original text is formulated in ordinary language then the term natural language formalization is often used. An example is the translation of the English sentence "some men are bald" into first-order logic as $\exists x(M(x)\land B(x))$ . The purpose is to reveal the logical structure of arguments. This makes it possible to use the precise rules of formal logic to assess whether these arguments are correct. It can also guide reasoning by arriving at new conclusions.

Many of the difficulties of the process are caused by vague or ambiguous expressions in natural language. For example, the English word "is" can mean that something exists, that it is identical to something else, or that it has a certain property. This contrasts with the precise nature of formal logic, which avoids such ambiguities. Natural language formalization is relevant to various fields in the sciences and humanities. It may play a key role for logic in general since it is needed to establish a link between many forms of reasoning and abstract logical systems. The use of informal logic is an alternative to formalization since it analyzes the cogency of ordinary language arguments in their original form. Natural language formalization is distinguished from logic translations that convert formulas from one logical system into another, for example, from modal logic to first-order logic. This form of logic translation is specifically relevant for logic programming and metalogic. (Full article...)
Image 5

The original TI-84 Plus calculator

The TI-84 Plus series is a line of graphing calculators produced by Texas Instruments. They are ubiquitous in the American education system, and have historically been considered the de facto standard in grade school math. The series has also amassed a significant hobbyist following, along with a large library of community-developed applications, for its support of assembly language and TI-BASIC programs.

The family was superseded by the TI-84 Plus CE series in 2015; of the original series, only the TI-84 Plus is still in production, the Silver Edition and C Silver Edition having been discontinued that same year. However, they remain popular in the United States, with the TI-84 Plus being issued by schools more than 20 years after its introduction. (Full article...)
$Image 6In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that n {\displaystyle n} runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least 1 / n {\displaystyle 1/n} units away from all others.The conjecture was first posed in 1967 by German mathematician Jörg Wills [de], in purely number-theoretic terms, and independently as a view-obstruction problem in 1974 by Thomas W. Cusick; its illustrative and now-popular formulation dates to 1998. The conjecture is known to be true for 13 {\displaystyle 13} runners or fewer, but the general case remains unsolved. Implications of the conjecture include solutions to view-obstruction problems and bounds on properties, related to chromatic numbers, of certain graphs. (Full article...)$
Image 6
In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that $n$ runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least $1/n$ units away from all others.

The conjecture was first posed in 1967 by German mathematician Jörg Wills [de], in purely number-theoretic terms, and independently as a view-obstruction problem in 1974 by Thomas W. Cusick; its illustrative and now-popular formulation dates to 1998. The conjecture is known to be true for $13$ runners or fewer, but the general case remains unsolved. Implications of the conjecture include solutions to view-obstruction problems and bounds on properties, related to chromatic numbers, of certain graphs. (Full article...)
Image 7
Which point on the surface of the spherical mirror can reflect a ray of light from the candle to the observer's eye?

Alhazen's problem is a mathematical problem in optics concerning reflection in a spherical mirror. It asks for the point in the mirror where one given point reflects to another.
The special case of a concave spherical mirror is also known as Alhazen's billiard problem, as it can be formulated equivalently as constructing a reflected path from one billiard ball to another on a circular billiard table. Other equivalent formulations ask for the shortest path from one point to the other that touches the circle, or for an ellipse that is tangent to the circle and has the given points as its foci.

Although special cases of this problem were studied by Ptolemy in the 2nd century CE, it is named for the 11th-century Arab mathematician Alhazen (Hasan Ibn al-Haytham), who formulated it more generally and presented a solution in his Book of Optics. It has no straightedge and compass construction; instead, al-Haytham and others including Christiaan Huygens found solutions involving the intersection of conic sections. According to Roberto Marcolongo, Leonardo da Vinci invented a mechanical device to solve the problem. Later mathematicians, starting with Jack M. Elkin [de] in 1965, solved the problem algebraically as the solution to a quartic equation, and used this equation to prove the impossibility of solving the problem with straightedge and compass. (Full article...)
Image 8
An arc diagram of the Goldner–Harary graph. This graph has no Hamiltonian cycle, but can be made Hamiltonian by subdividing the edge crossed by the red dashed line segment and adding two edges along this segment.

An arc diagram is a style of graph drawing, in which the vertices of a graph are placed along a line in the Euclidean plane and edges are drawn using semicircles or other convex curves above or below the line. These drawings are also called linear embeddings or circuit diagrams.

Applications of arc diagrams include information visualization, the Farey diagram of number-theoretic connections between rational numbers, and diagrams representing RNA secondary structure in which the crossings of the diagram represent pseudoknots in the structure. (Full article...)
$Image 9An m × n matrix: the m rows are horizontal and the n columns are vertical. Each element of a matrix is often denoted by a variable with two subscripts. For example, a2,1 represents the element at the second row and first column of the matrix.In mathematics, a matrix (: matrices) is a rectangular array of numbers or other mathematical objects with elements or entries arranged in rows and columns, usually satisfying certain properties of addition and multiplication. For example, [ 1 9 − 13 20 5 − 6 ] {\displaystyle {\begin{bmatrix}1&9&-13\\20&5&-6\end{bmatrix}}} denotes a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a 2 × 3 matrix, or a matrix of dimension 2 × 3. (Full article...)$
Image 9
An $m$ × $n$ matrix: the $m$ rows are horizontal and the $n$ columns are vertical. Each element of a matrix is often denoted by a variable with two subscripts. For example, $a 2,1$ represents the element at the second row and first column of the matrix.

In mathematics, a matrix (: matrices) is a rectangular array of numbers or other mathematical objects with elements or entries arranged in rows and columns, usually satisfying certain properties of addition and multiplication.

For example,
${\begin{bmatrix}1&9&-13\\20&5&-6\end{bmatrix}}$
denotes a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a 2 × 3 matrix, or a matrix of dimension 2 × 3. (Full article...)
Image 10

Ross in 1970

Arnold Ephraim Ross (August 24, 1906 – September 25, 2002) was a mathematician and educator who founded the Ross Mathematics Program, a number theory summer program for gifted high school students. He was born in Chicago, but spent his youth in Odesa, Ukraine, where he studied with Samuil Shatunovsky. Ross returned to Chicago and enrolled in University of Chicago graduate coursework under E. H. Moore, despite his lack of formal academic training. He received his Ph.D. and married his wife, Bee, in 1931.

Ross taught at several institutions including St. Louis University before becoming chair of University of Notre Dame's mathematics department in 1946. He started a teacher training program in mathematics that evolved into the Ross Mathematics Program in 1957 with the addition of high school students. The program moved with him to Ohio State University when he became their department chair in 1963. Though forced to retire in 1976, Ross ran the summer program until 2000. He had worked with over 2,000 students during more than forty summers. (Full article...)
Image 11
Stanisław Marcin Ulam (Polish: [sta'ɲiswaf 'mart͡ɕin 'ulam]; 13 April 1909 – 13 May 1984) was a Polish-American mathematician who made important contributions in advancing the understanding of nuclear physics and computer science. He participated in the Manhattan Project, originated the Teller–Ulam design of thermonuclear weapons, recognised the concept of the cellular automaton, invented the Monte Carlo method of computation, and championed nuclear pulse propulsion. In pure and applied mathematics, he proved a number of theorems and proposed several conjectures.

Born into a wealthy Polish Jewish family in Lemberg, Austria-Hungary, Ulam studied mathematics at the Lwów Polytechnic Institute, where he earned his PhD in 1933 under the supervision of Kazimierz Kuratowski and Włodzimierz Stożek. In 1935, John von Neumann, whom Ulam had met in Warsaw, invited him to come to the Institute for Advanced Study in Princeton, New Jersey, for a few months. From 1936 to 1939, he spent summers in Poland and academic years at Harvard University in Cambridge, Massachusetts, where he worked to establish important results regarding ergodic theory. On 20 August 1939, he sailed for the United States for the last time with his 17-year-old brother Adam Ulam. He became an assistant professor at the University of Wisconsin–Madison in 1940, and a United States citizen in 1941. (Full article...)
$Image 12A graph with intersection number four. The four shaded regions indicate four cliques that cover all the edges of the graph. In an intersection representation, each vertex can be represented by the subset of these cliques that it belongs to.In the mathematical field of graph theory, the intersection number of a graph G = ( V , E ) {\displaystyle G=(V,E)} is the smallest number of elements needed to represent G {\displaystyle G} as an intersection graph of finite sets. In such a representation, each vertex is represented as a set, and two vertices are connected by an edge whenever their sets have a common element. The intersection number equals the smallest number of cliques (subgraphs with edges between all pairs of vertices) needed to cover all of the edges of G {\displaystyle G} . Both this number and the computational problem of finding it have been studied under many alternative names.Applications of the intersection number include scheduling users of a shared resource or operations on very long instruction word computers, bandwidth allocation in fiber optic networks, data visualization using compact letter displays, the analysis of food webs in biology, and the inference of protein complexes from protein–protein interaction networks. (Full article...)$
Image 12
A graph with intersection number four. The four shaded regions indicate four cliques that cover all the edges of the graph. In an intersection representation, each vertex can be represented by the subset of these cliques that it belongs to.

In the mathematical field of graph theory, the intersection number of a graph $G=(V,E)$ is the smallest number of elements needed to represent $G$ as an intersection graph of finite sets. In such a representation, each vertex is represented as a set, and two vertices are connected by an edge whenever their sets have a common element. The intersection number equals the smallest number of cliques (subgraphs with edges between all pairs of vertices) needed to cover all of the edges of $G$ . Both this number and the computational problem of finding it have been studied under many alternative names.

Applications of the intersection number include scheduling users of a shared resource or operations on very long instruction word computers, bandwidth allocation in fiber optic networks, data visualization using compact letter displays, the analysis of food webs in biology, and the inference of protein complexes from protein–protein interaction networks. (Full article...)

More good articles

Did you know (auto-generated) – load new batch

... that Hannah Fry used mathematics to compare Elizabeth II's Christmas messages with the lyrics of Snoop Dogg?
... that the Prison Mathematics Project brought a professor from Italy to an American prison to celebrate Pi Day?
... that Caltech students called their calculus books "Tommy 1" and "Tommy 2"?
... that formal semantics uses logic and mathematics to study language?
... that in 1940 Xu Ruiyun became the first Chinese woman to receive a PhD in mathematics?
... that Eugene Parker described the mathematics behind his theory of solar wind as just "four lines of algebra"?
... that Pamela Ball was prouder of her mathematics degrees than of being the first Jamaican woman to be a fellow of the Royal College of Surgeons of England?
... that the father of Lithuanian scientific forestry also directed theatre, organized a school, compiled maps, and wrote a dictionary of plants, a mathematics textbook, and a collection of poetry?

More did you know – view different entries

Did you know...

...that every natural number can be written as the sum of four squares?
...that the largest known prime number is over 41 million digits long?
...that the set of rational numbers is equal in size to the set of integers; that is, they can be put in one-to-one correspondence?
...that there are precisely six convex regular polytopes in four dimensions? These are analogs of the five Platonic solids known to the ancient Greeks.
...that it is unknown whether π and e are algebraically independent?
...that a nonconvex polygon with three convex vertices is called a pseudotriangle?
...that it is possible for a three-dimensional figure to have a finite volume but infinite surface area, such as Gabriel's Horn?

More did you know facts

Showing 7 items out of 75

Selected article – show another

The German Lorenz cipher machine, used in World War II for encryption of very high-level general staff messages
Image credit: Matt Crypto

Cryptography (or cryptology) is derived from Greek κρυπτός kryptós "hidden," and the verb γράφω gráfo "write". In modern times, it has become a branch of information theory, as the mathematical study of information and especially its transmission from place to place. The noted cryptographer Ron Rivest has observed that "cryptography is about communication in the presence of adversaries." It is a central contributor to several fields: information security and related issues, particularly, authentication, and access control. One of cryptography's primary purposes is hiding the meaning of messages, not usually the existence of such messages. In modern times, cryptography also contributes to computer science. Cryptography is central to the techniques used in computer and network security for such things as access control and information confidentiality. Cryptography is also used in many applications encountered in everyday life; the security of ATM cards, computer passwords, and electronic commerce all depend on cryptography. (Full article...)

View all selected articles

Subcategories

Full category tree. Select [►] to view subcategories.

More mathematics categories

Topics in mathematics

General

Foundations

Number theory

Discrete mathematics

Algebra

Applied mathematics

Index of mathematics articles

ARTICLE INDEX:	0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
MATHEMATICIANS:	A B C D E F G H I J K L M N O P Q R S T U V W X Y Z