Portal:Mathematics

Abacus, a ancient hand-operated calculating.
Portrait of Emmy Noether, around 1900.
Euler's identity

Mathematics is a field of study that discovers and organizes methods, theories and theorems that are developed and proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). (Full article...)

Featured articles

Image 1
High-precision test of general relativity by the Cassini space probe (artist's impression): radio signals sent between the Earth and the probe (green wave) are delayed by the warping of spacetime (blue lines) due to the Sun's mass.

General relativity is a theory of gravitation developed by Albert Einstein between 1907 and 1915. The theory of general relativity says that the observed gravitational effect between masses results from their warping of spacetime.

By the beginning of the 20th century, Newton's law of universal gravitation had been accepted for more than two hundred years as a valid description of the gravitational force between masses. In Newton's model, gravity is the result of an attractive force between massive objects. Although even Newton was troubled by the unknown nature of that force, the basic framework was extremely successful at describing motion. (Full article...)
Image 2

Hilary Putnam

The Quine–Putnam indispensability argument is an argument in the philosophy of mathematics for the existence of abstract mathematical objects such as numbers and sets, a position known as mathematical platonism. It was named after the philosophers Willard Van Orman Quine and Hilary Putnam, and is one of the most important arguments in the philosophy of mathematics.

Although elements of the indispensability argument may have originated with thinkers such as Gottlob Frege and Kurt Gödel, Quine's development of the argument was unique for introducing to it a number of his philosophical positions such as naturalism, confirmational holism, and the criterion of ontological commitment. Putnam gave Quine's argument its first detailed formulation in his 1971 book Philosophy of Logic. He later came to disagree with various aspects of Quine's thinking, however, and formulated his own indispensability argument based on the no miracles argument in the philosophy of science. A standard form of the argument in contemporary philosophy is credited to Mark Colyvan; whilst being influenced by both Quine and Putnam, it differs in important ways from their formulations. It is presented in the Stanford Encyclopedia of Philosophy: (Full article...)
Image 3
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 4

The title page of a 1634 version of Hues' Tractatus de globis in the collection of the Biblioteca Nacional de Portugal

Robert Hues (1553 – 24 May 1632) was an English mathematician and geographer. He attended St. Mary Hall at Oxford, and graduated in 1578. Hues became interested in geography and mathematics, and studied navigation at a school set up by Walter Raleigh. During a trip to Newfoundland, he made observations which caused him to doubt the accepted published values for variations of the compass. Between 1586 and 1588, Hues travelled with Thomas Cavendish on a circumnavigation of the globe, performing astronomical observations and taking the latitudes of places they visited. Beginning in August 1591, Hues and Cavendish again set out on another circumnavigation of the globe. During the voyage, Hues made astronomical observations in the South Atlantic, and continued his observations of the variation of the compass at various latitudes and at the Equator. Cavendish died on the journey in 1592, and Hues returned to England the following year.

In 1594, Hues published his discoveries in the Latin work Tractatus de globis et eorum usu (Treatise on Globes and Their Use) which was written to explain the use of the terrestrial and celestial globes that had been made and published by Emery Molyneux in late 1592 or early 1593, and to encourage English sailors to use practical astronomical navigation. Hues' work subsequently went into at least 12 other printings in Dutch, English, French and Latin. (Full article...)
Image 5

Bust of Shen at the Beijing Ancient Observatory

Shen Kuo (Chinese: 沈括; 1031–1095) or Shen Gua, courtesy name Cunzhong (存中) and pseudonym Mengqi (now usually given as Mengxi) Weng (夢溪翁), was a Chinese polymath, scientist, and statesman of the Song dynasty (960–1279). Shen was a master in many fields of study including mathematics, optics, and horology. In his career as a civil servant, he became a finance minister, governmental state inspector, head official for the Bureau of Astronomy in the Song court, Assistant Minister of Imperial Hospitality, and also served as an academic chancellor. At court his political allegiance was to the Reformist faction known as the New Policies Group, headed by Chancellor Wang Anshi (1021–1085).

In his Dream Pool Essays or Dream Torrent Essays (夢溪筆談; Mengxi Bitan) of 1088, Shen was the first to describe the magnetic needle compass, which would be used for navigation (first described in Europe by Alexander Neckam in 1187). Shen discovered the concept of true north in terms of magnetic declination towards the north pole, with experimentation of suspended magnetic needles and "the improved meridian determined by Shen's [astronomical] measurement of the distance between the pole star and true north". This was the decisive step in human history to make compasses more useful for navigation, and may have been a concept unknown in Europe for another four hundred years (evidence of German sundials made circa 1450 show markings similar to Chinese geomancers' compasses in regard to declination). (Full article...)
Image 6

Title page of the first edition of Wright's Certaine Errors in Navigation (1599)

Edward Wright (baptised 8 October 1561; died November 1615) was an English mathematician and cartographer noted for his book Certaine Errors in Navigation (1599; 2nd ed., 1610), which for the first time explained the mathematical basis of the Mercator projection by building on the works of Pedro Nunes, and set out a reference table giving the linear scale multiplication factor as a function of latitude, calculated for each minute of arc up to a latitude of 75°. This was in fact a table of values of the integral of the secant function, and was the essential step needed to make practical both the making and the navigational use of Mercator charts.

Wright was born at Garveston in Norfolk and educated at Gonville and Caius College, Cambridge, where he became a fellow from 1587 to 1596. In 1589 the college granted him leave after Elizabeth I requested that he carry out navigational studies with a raiding expedition organised by the Earl of Cumberland to the Azores to capture Spanish galleons. The expedition's route was the subject of the first map to be prepared according to Wright's projection, which was published in Certaine Errors in 1599. The same year, Wright created and published the first world map produced in England and the first to use the Mercator projection since Gerardus Mercator's original 1569 map. (Full article...)
Image 7
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 8

Portrait by Jakob Emanuel Handmann, 1753

Leonhard Euler (/ˈɔɪlər/ OY-lər; German: [ˈleːɔnhaʁt ˈʔɔʏlɐ] , Swiss Standard German: [ˈleɔnhard ˈɔʏlər]; 15 April 1707 – 18 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, 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 which helped navigation, his three volumes on optics contributed to the design of microscopes and telescopes, and he studied the bending of beams and the critical load of columns. (Full article...)
Image 9

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 the 17th century studies of probability and annuities. Actuaries of the 21st century require analytical skills, business knowledge, and an understanding of human behavior and information systems 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 10
Plots of logarithm functions, with three commonly used bases. The special points $log b b = 1$ are indicated by dotted lines, and all curves intersect in $log b 1 = 0$ .

In mathematics, the logarithm of a number is the exponent by which another fixed value, the base, must be raised to produce that number. For example, the logarithm of $1000$ to base $10$ is $3$ , because $1000$ is $10$ to the $3$ rd power: $1000 = 10 3 = 10 \times 10 \times 10$ . More generally, if $x = b y$ , then $y$ is the logarithm of $x$ to base $b$ , written $log b x$ , so $log 10 1000 = 3$ . As a single-variable function, the logarithm to base $b$ is the inverse of exponentiation with base $b$ .

The logarithm base $10$ is called the decimal or common logarithm and is commonly used in science and engineering. The natural logarithm has the number $e \approx 2.718$ as its base; its use is widespread in mathematics and physics because of its very simple derivative. The binary logarithm uses base $2$ and is widely used in computer science, information theory, music theory, and photography. When the base is unambiguous from the context or irrelevant it is often omitted, and the logarithm is written $log x$ . (Full article...)
Image 11

Noether c. 1900–1910

Amalie Emmy Noether (US: /ˈnʌtər/, UK: /ˈnɜːtə/; German: [ˈnøːtɐ]; 23 March 1882 – 14 April 1935) was a German mathematician who made many important contributions to abstract algebra. She proved Noether's first and second theorems, which are fundamental in mathematical physics. She 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, 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, she was invited by David Hilbert and Felix Klein to join the mathematics department at the University of Göttingen, a world-renowned center of mathematical research. The philosophical faculty objected, however, 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...)
Image 12

Elementary algebra studies which values solve equations formed using arithmetical operations.

Algebra is the branch of mathematics that studies certain abstract systems, known as algebraic structures, and the manipulation of expressions within those systems. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations, such as addition and multiplication.

Elementary algebra is the main form of algebra taught in schools. It examines mathematical statements using variables for unspecified values and seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field that investigates linear equations and combinations of them called systems of linear equations. It provides methods to find the values that solve all equations in the system at the same time, and to study the set of these solutions. (Full article...)
Image 13

Richard Phillips Feynman (/ˈfaɪnmən/; May 11, 1918 – February 15, 1988) was an American theoretical physicist. He is best known for his work in the path integral formulation of quantum mechanics, the theory of quantum electrodynamics, the physics of the superfluidity of supercooled liquid helium, and in particle physics, for which he proposed the parton model. For his contributions to the development of quantum electrodynamics, Feynman received the Nobel Prize in Physics in 1965 jointly with Julian Schwinger and Shin'ichirō Tomonaga.

Feynman developed a widely used pictorial representation scheme for the mathematical expressions describing the behavior of subatomic particles, which later became known as Feynman diagrams. During his lifetime, Feynman became one of the best-known scientists in the world. 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 14

Archimedes Thoughtful by Fetti (1620)

Archimedes of Syracuse (/ˌɑːrkɪˈmiːdiːz/ AR-kim-EE-deez; c. 287 – c. 212 BC) was an Ancient Greek mathematician, physicist, engineer, astronomer, and inventor from the ancient city of Syracuse in Sicily. Although few details of his life are known, he is considered one of the leading scientists in classical antiquity. Regarded as the greatest mathematician of ancient history, and one of the greatest of all time, Archimedes anticipated modern calculus and analysis by applying the concept of the infinitely small and the method of exhaustion to derive and rigorously prove a range of geometrical theorems. These include the area of a circle, the surface area and volume of a sphere, the area of an ellipse, the area under a parabola, the volume of a segment of a paraboloid of revolution, the volume of a segment of a hyperboloid of revolution, and the area of a spiral.

Archimedes' other mathematical achievements include deriving an approximation of pi ( $π$ ), defining and investigating the Archimedean spiral, and devising a system using exponentiation for expressing very large numbers. He was also one of the first to apply mathematics to physical phenomena, working on statics and hydrostatics. Archimedes' achievements in this area include a proof of the law of the lever, the widespread use of the concept of center of gravity, and the enunciation of the law of buoyancy known as Archimedes' principle. In astronomy, he made measurements of the apparent diameter of the Sun and the size of the universe. He is also credited with designing innovative machines, such as his screw pump, compound pulleys, and defensive war machines to protect his native Syracuse from invasion. (Full article...)
$Image 15 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, a step-by-step procedure for performing a calculation according to well-defined rules, 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 15
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, a step-by-step procedure for performing a calculation according to well-defined rules,
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...)

Good articles

Image 1

Einstein in 1921

Albert Einstein (/ˈaɪnstaɪn/, EYEN-styne; German: [ˈalbɛʁt ˈʔaɪnʃtaɪn] ; 14 March 1879 – 18 April 1955) was a German-born theoretical physicist who is best known for developing the theory of relativity. Einstein also made important contributions to quantum mechanics. His mass–energy equivalence formula E = mc2, which arises from special relativity, has been called "the world's most famous equation". He received the 1921 Nobel Prize in Physics for his services to theoretical physics, and especially for his discovery of the law of the photoelectric effect.

Born in the German Empire, Einstein moved to Switzerland in 1895, forsaking his German citizenship the following year. In 1897, at the age of seventeen, he enrolled in the mathematics and physics teaching diploma program at the Swiss Federal Polytechnic School in Zurich, graduating in 1900. He acquired Swiss citizenship a year later and afterwards secured a permanent position at the Swiss Patent Office in Bern. In 1905, he submitted a successful PhD dissertation to the University of Zurich. In 1914, he moved to Berlin to join the Prussian Academy of Sciences and the Humboldt University of Berlin, becoming director of the Kaiser Wilhelm Institute for Physics. In 1933, while Einstein was visiting the United States, Adolf Hitler came to power in Germany. Horrified by the Nazi persecution of his fellow Jews, he decided to remain in the US, and was granted American citizenship in 1940. On the eve of World War II, he endorsed a letter to President Franklin D. Roosevelt alerting him to the potential German nuclear weapons program and recommending that the US begin similar research. (Full article...)
Image 2
Title page of De quinque corporibus regularibus

De quinque corporibus regularibus (sometimes called Libellus de quinque corporibus regularibus) is a book on the geometry of polyhedra written in the 1480s or early 1490s by Italian painter and mathematician Piero della Francesca. It is a manuscript, in the Latin language; its title means [the little book] on the five regular solids. It is one of three books known to have been written by della Francesca.

Along with the Platonic solids, De quinque corporibus regularibus includes descriptions of five of the thirteen Archimedean solids, and of several other irregular polyhedra coming from architectural applications. It was the first of what would become many books connecting mathematics to art through the construction and perspective drawing of polyhedra, including Luca Pacioli's 1509 Divina proportione (which incorporated without credit an Italian translation of della Francesca's work). (Full article...)
Image 3
Kissing circles. Given three mutually tangent circles (black), there are, in general, two possible answers (red) as to what radius a fourth tangent circle can have.

In geometry, Descartes' theorem states that for every four kissing, or mutually tangent, circles, the radii of the circles satisfy a certain quadratic equation. By solving this equation, one can construct a fourth circle tangent to three given, mutually tangent circles. The theorem is named after René Descartes, who stated it in 1643.

Frederick Soddy's 1936 poem The Kiss Precise summarizes the theorem in terms of the bends (signed inverse radii) of the four circles: (Full article...)
Image 4
A set of 20 points in a 10 × 10 grid, with no three points in a line.

The no-three-in-line problem in discrete geometry asks how many points can be placed in the $n\times n$ grid so that no three points lie on the same line. The problem concerns lines of all slopes, not only those aligned with the grid. It was introduced by Henry Dudeney in 1900. Brass, Moser, and Pach call it "one of the oldest and most extensively studied geometric questions concerning lattice points".

At most $2n$ points can be placed, because $2n+1$ points in a grid would include a row of three or more points, by the pigeonhole principle. Although the problem can be solved with $2n$ points for every $n$ up to $46$ , it is conjectured that fewer than $2n$ points can be placed in grids of large size. Known methods can place linearly many points in grids of arbitrary size, but the best of these methods place slightly fewer than $1.5n$ points, not $2n$ . (Full article...)
Image 5
The brute force algorithm finds a 4-clique in this 7-vertex graph (the complement of the 7-vertex path graph) by systematically checking all C(7,4) = 35 4-vertex subgraphs for completeness.

In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found. Common formulations of the clique problem include finding a maximum clique (a clique with the largest possible number of vertices), finding a maximum weight clique in a weighted graph, listing all maximal cliques (cliques that cannot be enlarged), and solving the decision problem of testing whether a graph contains a clique larger than a given size.

The clique problem arises in the following real-world setting. Consider a social network, where the graph's vertices represent people, and the graph's edges represent mutual acquaintance. Then a clique represents a subset of people who all know each other, and algorithms for finding cliques can be used to discover these groups of mutual friends. Along with its applications in social networks, the clique problem also has many applications in bioinformatics, and computational chemistry. (Full article...)
Image 6
A convex curve (black) forms a connected subset of the boundary of a convex set (blue), and has a supporting line (red) through each of its points.

In geometry, a convex curve is a plane curve that has a supporting line through each of its points. There are many other equivalent definitions of these curves, going back to Archimedes. Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves include the closed convex curves (the boundaries of bounded convex sets), the smooth curves that are convex, and the strictly convex curves, which have the additional property that each supporting line passes through a unique point of the curve.

Bounded convex curves have a well-defined length, which can be obtained by approximating them with polygons, or from the average length of their projections onto a line. The maximum number of grid points that can belong to a single curve is controlled by its length. The points at which a convex curve has a unique supporting line are dense within the curve, and the distance of these lines from the origin defines a continuous support function. A smooth simple closed curve is convex if and only if its curvature has a consistent sign, which happens if and only if its total curvature equals its total absolute curvature. (Full article...)
Image 7
Stanisław Marcin Ulam (Polish: [sta'ɲiswaf 'mart͡ɕin 'ulam]; 13 April 1909 – 13 May 1984) was a Polish mathematician, nuclear physicist and computer scientist. He participated in the Manhattan Project, originated the Teller–Ulam design of thermonuclear weapons, discovered the concept of the cellular automaton, invented the Monte Carlo method of computation, and suggested 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 8
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 9
Using the Pythagorean theorem to compute two-dimensional Euclidean distance

In mathematics, the Euclidean distance between two points in Euclidean space is the length of the line segment between them. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem, and therefore is occasionally called the Pythagorean distance.

These names come from the ancient Greek mathematicians Euclid and Pythagoras. In the Greek deductive geometry exemplified by Euclid's Elements, distances were not represented as numbers but line segments of the same length, which were considered "equal". The notion of distance is inherent in the compass tool used to draw a circle, whose points all have the same distance from a common center point. The connection from the Pythagorean theorem to distance calculation was not made until the 18th century. (Full article...)
$Image 10 A perspective projection of a dodecahedral tessellation in H3. Note the recursive structure: each pentagon contains smaller pentagons, which contain smaller pentagons. This is an example of a subdivision rule arising from a finite universe (i.e. a closed 3-manifold). In mathematics, a finite subdivision rule is a recursive way of dividing a polygon or other two-dimensional shape into smaller and smaller pieces. Subdivision rules in a sense are generalizations of regular geometric fractals. Instead of repeating exactly the same design over and over, they have slight variations in each stage, allowing a richer structure while maintaining the elegant style of fractals. Subdivision rules have been used in architecture, biology, and computer science, as well as in the study of hyperbolic manifolds. Substitution tilings are a well-studied type of subdivision rule. (Full article...)$

Image 10
A perspective projection of a dodecahedral tessellation in H³. Note the recursive structure: each pentagon contains smaller pentagons, which contain smaller pentagons. This is an example of a subdivision rule arising from a finite universe (i.e. a closed 3-manifold).

In mathematics, a finite subdivision rule is a recursive way of dividing a polygon or other two-dimensional shape into smaller and smaller pieces. Subdivision rules in a sense are generalizations of regular geometric fractals. Instead of repeating exactly the same design over and over, they have slight variations in each stage, allowing a richer structure while maintaining the elegant style of fractals. Subdivision rules have been used in architecture, biology, and computer science, as well as in the study of hyperbolic manifolds. Substitution tilings are a well-studied type of subdivision rule. (Full article...)
Image 11
In graph theory, the De Bruijn–Erdős theorem relates graph coloring of an infinite graph to the same problem on its finite subgraphs. It states that, when all finite subgraphs can be colored with $c$ colors, the same is true for the whole graph. The theorem was proved by Nicolaas Govert de Bruijn and Paul Erdős (1951), after whom it is named.

The De Bruijn–Erdős theorem has several different proofs, all depending in some way on the axiom of choice. Its applications include extending the four-color theorem and Dilworth's theorem from finite graphs and partially ordered sets to infinite ones, and reducing the Hadwiger–Nelson problem on the chromatic number of the plane to a problem about finite graphs. It may be generalized from finite numbers of colors to sets of colors whose cardinality is a strongly compact cardinal. (Full article...)
Image 12
In mathematics, the three-gap theorem, three-distance theorem, or Steinhaus conjecture states that if one places $n$ points on a circle, at angles of $θ$ , $2 θ$ , $3 θ$ , ... from the starting point, then there will be at most three distinct distances between pairs of points in adjacent positions around the circle. When there are three distances, the largest of the three always equals the sum of the other two. Unless $θ$ is a rational multiple of $π$ , there will also be at least two distinct distances.

This result was conjectured by Hugo Steinhaus, and proved in the 1950s by Vera T. Sós, János Surányi [hu], and Stanisław Świerczkowski; more proofs were added by others later. Applications of the three-gap theorem include the study of plant growth and musical tuning systems, and the theory of light reflection within a mirrored square. (Full article...)

Did you know

... that Fathimath Dheema Ali is the first Olympic qualifier from the Maldives?
... that in 1940 Xu Ruiyun became the first Chinese woman to receive a PhD in mathematics?
... that Catechumen, a Christian first-person shooter, was funded only in the aftermath of the Columbine High School massacre?
... that two members of the French parliament were killed when a delayed-action German bomb exploded in the town hall at Bapaume on 25 March 1917?
... that subgroup distortion theory, introduced by Misha Gromov in 1993, can help encode text?
... that Green Day's "Wake Me Up When September Ends" became closely associated with the aftermath of Hurricane Katrina?
... that Ewa Ligocka cooked another mathematician's goose?
... that the word algebra is derived from an Arabic term for the surgical treatment of bonesetting?

Did you know...

... that, according to the pizza theorem, a circular pizza that is sliced off-center into eight equal-angled wedges can still be divided equally between two people?
... that the clique problem of programming a computer to find complete subgraphs in an undirected graph was first studied as a way to find groups of people who all know each other in social networks?
... that the Herschel graph is the smallest possible polyhedral graph that does not have a Hamiltonian cycle?
... that the Life without Death cellular automaton, a mathematical model of pattern formation, is a variant of Conway's Game of Life in which cells, once brought to life, never die?
... that one can list every positive rational number without repetition by breadth-first traversal of the Calkin–Wilf tree?
... that the Hadwiger conjecture implies that the external surface of any three-dimensional convex body can be illuminated by only eight light sources, but the best proven bound is that 16 lights are sufficient?
... that an equitable coloring of a graph, in which the numbers of vertices of each color are as nearly equal as possible, may require far more colors than a graph coloring without this constraint?

More did you know facts

Showing 7 items out of 75

Featured pictures

Image 1Proof of the Pythagorean theorem, by Joaquim Alves Gaspar (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 2Topological knots, by Jkasd (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 3Missing square puzzle, by Fibonacci (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 4Mandelbrot set, step 12, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
$Image 5Lyapunov fractal, by BernardH (from Wikipedia:Featured pictures/Sciences/Mathematics)$

Image 5Lyapunov fractal, by BernardH (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 6Mandelbrot set, step 13, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 7Mandelbrot set, step 9, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 8Tetrahedral group at Symmetry group, by Debivort (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 9Mandelbrot set, step 10, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 10Anscombe's quartet, by Schutz (edited by Avenue) (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 11Mandelbrot set, start, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 12Breeder, by Protious/Hyperdeath (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 13Mandelbrot set, step 4, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 14Mandelbrot set, step 1, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 15Helicatenoid, by Wickerprints (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 16Hypotrochoid, by Sam Derbyshire (edited by Anevrisme and Perhelion) (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 17Mandelbrot set, step 3, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 18Mandelbrot set, step 8, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 19Non-uniform rational B-spline, by Greg L (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 20Line integral of scalar field, by Lucas V. Barbosa (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 21Desargues' theorem, by Dynablast (edited by Jujutacular and Julia W) (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 22Mandelbrot set, step 14, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 23Mandelbrot set, step 7, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 24Fields Medal, back, by Stefan Zachow (edited by King of Hearts) (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 25Radian, by Lucas V. Barbosa (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 26Cellular automata at Reflector (cellular automaton), by Simpsons contributor (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 27Mandelbrot set, by Simpsons contributor (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 28Mandelbrot set, step 5, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 29Fields Medal, front, by Stefan Zachow (edited by King of Hearts) (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 30Mandelbulb, by Ondřej Karlík (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 31Mandelbrot set, step 2, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 32Mandelbrot set, step 11, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 33Mandelbrot set, step 6, by Wolfgangbeyer (from Wikipedia:Featured pictures/Sciences/Mathematics)
Image 34Lorenz attractor at Chaos theory, by Wikimol (from Wikipedia:Featured pictures/Sciences/Mathematics)

Get involved

For editor resources and to collaborate with other editors on improving Wikipedia's Mathematics-related articles, visit WikiProject Mathematics.

Categories

» Category:Mathematics, Category:People

Topics

» Lists of mathematics topics, Glossary of areas of mathematics, History of mathematics

Index of 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

Vital articles

» subpages: Level 4 Mathematics articles, Level 5 Mathematics articles

Discover Wikipedia using portals