Portal:Mathematics

The Mathematics Portal

Square root

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...)

Featured articles -

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

---

• 

  

  The repeating decimal continues infinitely

  
  
  In mathematics, 0.999... (also written as 0.9, in repeating decimal notation) denotes the repeating decimal consisting of an unending sequence of 9s after the decimal point. This repeating decimal represents the smallest number no less than every decimal number in the sequence (0.9, 0.99, 0.999, ...); that is, the supremum of this sequence. This number is equal to 1. In other words, "0.999..." is not "almost exactly" or "very, very nearly but not quite" 1  –  rather, "0.999..." and "1" represent exactly the same number.
  
  There are many ways of showing this equality, from intuitive arguments to mathematically rigorous proofs. The technique used depends on the target audience, background assumptions, historical context, and preferred development of the real numbers, the system within which 0.999... is commonly defined. In other systems, 0.999... can have the same meaning, a different definition, or be undefined. (Full article...)
• 

  

  Figure 1: A solution (in purple) to Apollonius's problem. The given circles are shown in black.

  
  
  In Euclidean plane geometry, Apollonius's 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 does not use only straightedge and compass constructions. François Viète found such a 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' method. The method of van Roomen was simplified by Isaac Newton, who showed that Apollonius' 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...)
• 

  

  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...)
• 

  Rejewski, c. 1932

  
  Marian Adam Rejewski (Polish: [ˈmarjan rɛˈjɛfskʲi] (listen); 16 August 1905 – 13 February 1980) was a Polish mathematician and cryptologist who in late 1932 reconstructed the sight-unseen German military Enigma cipher machine, aided by limited documents obtained by French military intelligence. Over the next nearly seven years, Rejewski and fellow mathematician-cryptologists Jerzy Różycki and Henryk Zygalski developed and used techniques and equipment to decrypt the German machine ciphers, even as the Germans introduced modifications to their equipment and encryption procedures. Five weeks before the outbreak of World War II the Poles, at a conference in Warsaw, shared their achievements with the French and British, thus enabling Britain to begin reading German Enigma-encrypted messages, seven years after Rejewski's original reconstruction of the machine. The intelligence that was gained by the British from Enigma decrypts formed part of what was code-named Ultra and contributed—perhaps decisively—to the defeat of Germany.
  
  In 1929, while studying mathematics at Poznań University, Rejewski attended a secret cryptology course conducted by the Polish General Staff's Cipher Bureau (Biuro Szyfrów), which he joined in September 1932. The Bureau had had no success in reading Enigma-enciphered messages and set Rejewski to work on the problem in late 1932; he deduced the machine's secret internal wiring after only a few weeks. Rejewski and his two colleagues then developed successive techniques for the regular decryption of Enigma messages. His own contributions included the cryptologic card catalog, derived using the cyclometer that he had invented, and the cryptologic bomb. (Full article...)
• 

  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 business professional with advanced statistical skills who deals with the measurement and management of risk and uncertainty. The name of the corresponding field is actuarial science. 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.
  
  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 and manage programs that control risk. The actual steps needed to become an actuary are usually country-specific; however, almost all processes share a rigorous schooling or examination structure and take many years to complete. (Full article...)
• 

  One of Molyneux's celestial globes, which is displayed in Middle Temple Library – from the frontispiece of the Hakluyt Society's 1889 reprint of A Learned Treatise of Globes, both Cœlestiall and Terrestriall, one of the English editions of Robert Hues' Latin work Tractatus de Globis (1594)

  
  Emery Molyneux (/ˈɛməri ˈmɒlɪnoʊ/ EM-ər-ee MOL-in-oh; died June 1598) was an English Elizabethan maker of globes, mathematical instruments and ordnance. His terrestrial and celestial globes, first published in 1592, were the first to be made in England and the first to be made by an Englishman.
  
  Molyneux was known as a mathematician and maker of mathematical instruments such as compasses and hourglasses. He became acquainted with many prominent men of the day, including the writer Richard Hakluyt and the mathematicians Robert Hues and Edward Wright. He also knew the explorers Thomas Cavendish, Francis Drake, Walter Raleigh and John Davis. Davis probably introduced Molyneux to his own patron, the London merchant William Sanderson, who largely financed the construction of the globes. When completed, the globes were presented to Elizabeth I. Larger globes were acquired by royalty, noblemen and academic institutions, while smaller ones were purchased as practical navigation aids for sailors and students. The globes were the first to be made in such a way that they were unaffected by the humidity at sea, and they came into general use on ships. (Full article...)
• 

  

  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...)
• 

  Portrait by Jakob Emanuel Handmann (1753)

  
  Leonhard Euler (/ˈɔɪlər/ OY-lər, German: [ˈɔʏlɐ] (listen); 15 April 1707 – 18 September 1783) was a Swiss mathematician, physicist, astronomer, geographer, logician and engineer who founded the studies of graph theory and topology and made pioneering and influential discoveries in many other branches of mathematics such as analytic number theory, complex analysis, and infinitesimal calculus. He introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is also known for his work in mechanics, fluid dynamics, optics, astronomy and music theory.
  
  Euler is held to be one of the greatest mathematicians in history and the greatest of the 18th century. A statement attributed to Pierre-Simon Laplace expresses Euler's influence on mathematics: "Read Euler, read Euler, he is the master of us all." Carl Friedrich Gauss remarked: "The study of Euler's works will remain the best school for the different fields of mathematics, and nothing else can replace it." Euler is also widely considered to be the most prolific; his 866 publications as well as his correspondences are collected in the Opera Omnia Leonhard Euler which, when completed, will consist of 81 quarto volumes. He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia. (Full article...)
• 

  Feynman c. 1965

  
  Richard Phillips Feynman (/ˈfaɪnmən/; May 11, 1918 – February 15, 1988) was an American theoretical physicist, 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, as well as his work 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...)
• 

  

  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 (numbers), 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, they are 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...)
• 

  General relativity, also known as the general theory of relativity and Einstein's theory of gravity, is the geometric theory of gravitation published by Albert Einstein in 1915 and is the current description of gravitation in modern physics. General relativity generalizes special relativity and refines 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 and momentum of whatever matter and radiation are present. The relation is specified by the Einstein field equations, a system of second order partial differential equations.
  
  Newton's law of universal gravitation, which describes classical gravity, 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 and singularities/black holes. So far, all tests of general relativity have been shown to be in agreement with the theory. The time dependent solutions of general relativity enable us to talk about the history of the universe 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...)
• 

  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...)
• 

  

  
  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 discovered Noether's First and Second Theorem, 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 some 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...)
• 

  Josiah Willard Gibbs

  
  Josiah Willard Gibbs (/ɡɪbz/; February 11, 1839 – April 28, 1903) was an American scientist who made significant theoretical contributions to physics, chemistry, and mathematics. His work on the applications of thermodynamics was instrumental in transforming physical chemistry into a rigorous inductive 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 invented modern vector calculus (independently of the British scientist Oliver Heaviside, who carried out similar work during the same period).
  
  In 1863, Yale 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...)
• 

  The number π (/paɪ/; spelled out as "pi") is a mathematical constant that is the ratio of a circle's circumference to its diameter, approximately equal to 3.14159. The number π appears in many formulas across mathematics and physics. It is an irrational number, meaning that it cannot be expressed exactly as a ratio of two integers, although fractions such as ${\tfrac {22}{7}}$ are commonly used to approximate it. Consequently, its decimal representation never ends, nor enters a permanently repeating pattern. It is a transcendental number, meaning that it cannot be a solution of an equation involving only sums, products, powers, and integers. The transcendence of π implies that it is impossible to solve the ancient challenge of squaring the circle with a compass and straightedge. The decimal digits of π appear to be randomly distributed, but no proof of this conjecture has been found.
  
  For thousands of years, mathematicians have attempted to extend their understanding of π, sometimes by computing its value to a high degree of accuracy. Ancient civilizations, including the Egyptians and Babylonians, required fairly accurate approximations of π for practical computations. Around 250 BC, the Greek mathematician Archimedes created an algorithm to approximate π with arbitrary accuracy. In the 5th century AD, Chinese mathematicians approximated π to seven digits, while Indian mathematicians made a five-digit approximation, both using geometrical techniques. The first computational formula for π, based on infinite series, was discovered a millennium later. The earliest known use of the Greek letter π to represent the ratio of a circle's circumference to its diameter was by the Welsh mathematician William Jones in 1706. (Full article...)

Selected image –

Desargues's theorem

Credit: User:Jujutacular, based on an original by User:DynaBlast

In projective geometry, Desargues' theorem states that two triangles are in perspective axially if and only if they are in perspective centrally. Lines through the triangle sides meet in pairs at collinear points along the axis of perspectivity. Lines through corresponding pairs of vertices on the triangles meet at a point called the center of perspectivity.

Good articles -

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

---

• 

  Stanisław Marcin Ulam ([sta'ɲiswaf 'mart͡ɕin 'ulam]; 13 April 1909 – 13 May 1984) was a Polish scientist in the fields of mathematics and nuclear physics. 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 some theorems and proposed several conjectures.
  
  Born into a wealthy Polish Jewish family, 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...)
• 

  

  Euclidean minimum spanning tree of 25 random points in the plane

  
  
  A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system of line segments with the points as endpoints, minimizing the total length of the segments. In it, any two points can reach each other along a path through the line segments. It can be found as the minimum spanning tree of a complete graph with the points as vertices and the Euclidean distances between points as edge weights.
  
  The edges of the minimum spanning tree meet at angles of at least 60°, at most six to a vertex. In higher dimensions, the number of edges per vertex is bounded by the kissing number of tangent unit spheres. The total length of the edges, for points in a unit square, is at most proportional to the square root of the number of points. Each edge lies in an empty region of the plane, and these regions can be used to prove that the Euclidean minimum spanning tree is a subgraph of other geometric graphs including the relative neighborhood graph and Delaunay triangulation. By constructing the Delaunay triangulation and then applying a graph minimum spanning tree algorithm, the minimum spanning tree of $n$ given planar points may be found in time $O(n\log n)$, as expressed in big O notation. This is optimal in some models of computation, although faster randomized algorithms exist for points with integer coordinates. For points in higher dimensions, finding an optimal algorithm remains an open problem. (Full article...)
• 

  

  3 + 2 = 5 with apples, a popular choice in textbooks

  
  Addition (usually signified by the plus symbol +) is one of the four basic operations of arithmetic, the other three being subtraction, multiplication and division. The addition of two whole numbers results in the total amount or sum of those values combined. The example in the adjacent image shows a combination of three apples and two apples, making a total of five apples. This observation is equivalent to the mathematical expression "3 + 2 = 5" (that is, "3 plus 2 is equal to 5").
  
  Besides counting items, addition can also be defined and executed without referring to concrete objects, using abstractions called numbers instead, such as integers, real numbers and complex numbers. Addition belongs to arithmetic, a branch of mathematics. In algebra, another area of mathematics, addition can also be performed on abstract objects such as vectors, matrices, subspaces and subgroups. (Full article...)
• 

  

  Composite numbers can be arranged into rectangles but prime numbers cannot.

  
  
  A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself.
  However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.
  
  The property of being prime is called primality. A simple but slow method of checking the primality of a given number $n$, called trial division, tests whether $n$ is a multiple of any integer between 2 and ${\sqrt {n}}$. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for numbers of special forms, such as Mersenne numbers. the largest known prime number is a Mersenne prime with 24,862,048 decimal digits. (Full article...)
• 

  

  Partition of a directed graph into a minimum feedback arc set (red dashed edges) and a maximum acyclic subgraph (blue solid edges)

  
  In graph theory and graph algorithms, a feedback arc set or feedback edge set in a directed graph is a subset of the edges of the graph that contains at least one edge out of every cycle in the graph. Removing these edges from the graph breaks all of the cycles, producing a directed acyclic graph, an acyclic subgraph of the given graph. The feedback arc set with the fewest possible edges is the minimum feedback arc set and its removal leaves the maximum acyclic subgraph; weighted versions of these optimization problems are also used. If a feedback arc set is minimal, meaning that removing any edge from it produces a subset that is not a feedback arc set, then it has an additional property: reversing all of its edges, rather than removing them, produces a directed acyclic graph.
  
  Feedback arc sets have applications in circuit analysis, chemical engineering, deadlock resolution, ranked voting, ranking competitors in sporting events, mathematical psychology, ethology, and graph drawing. Finding minimum feedback arc sets and maximum acyclic subgraphs is NP-hard; it can be solved exactly in exponential time, or in fixed-parameter tractable time. In polynomial time, the minimum feedback arc set can be approximated to within a polylogarithmic approximation ratio, and maximum acyclic subgraphs can be approximated to within a constant factor. Both are hard to approximate closer than some constant factor, an inapproximability result that can be strengthened under the unique games conjecture. For tournament graphs, the minimum feedback arc set can be approximated more accurately, and for planar graphs both problems can be solved exactly in polynomial time. (Full article...)
• 

  

  Graphical demonstration that 1 = 1/2 + 1/3 + 1/11 + 1/23 + 1/31 + 1/(2×3×11×23×31). Each row of k squares of side length 1/k has total area 1/k, and all the squares together exactly cover a larger square with area 1. The bottom row of 47058 squares with side length 1/47058 is too small to see in the figure and is not shown.

  
  In number theory, Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972, although other mathematicians had considered similar problems around the same time.
  
  The initial terms of Sylvester's sequence almost solve this problem, except that the last chosen term equals one plus the product of the others, rather than being a proper divisor. Sun (1983) showed that there is at least one solution to the (proper) Znám problem for each $k\geq 5$. Sun's solution is based on a recurrence similar to that for Sylvester's sequence, but with a different set of initial values. (Full article...)
• 

  

  Three of the ordinary lines in a 4 × 4 grid of points

  
  The Sylvester–Gallai theorem in geometry states that every finite set of points in the Euclidean plane has a line that passes through exactly two of the points or a line that passes through all of them. It is named after James Joseph Sylvester, who posed it as a problem in 1893, and Tibor Gallai, who published one of the first proofs of this theorem in 1944.
  
  A line that contains exactly two of a set of points is known as an ordinary line. Another way of stating the theorem is that every finite set of points that is not collinear has an ordinary line. According to a strengthening of the theorem, every finite point set (not all on one line) has at least a linear number of ordinary lines. An algorithm can find an ordinary line in a set of $n$ points in time $O(n\log n)$. (Full article...)
• 

  Example  of  non‑periodicity  due to another orientation of one tile out of an infinite number of identical tiles.

  
  A tessellation or tiling is the covering of a surface, often a plane, using one or more geometric shapes, called tiles, with no overlaps and no gaps. In mathematics, tessellation can be generalized to higher dimensions and a variety of geometries.
  
  A periodic tiling has a repeating pattern. Some special kinds include regular tilings with regular polygonal tiles all of the same shape, and semiregular tilings with regular tiles of more than one shape and with every corner identically arranged. The patterns formed by periodic tilings can be categorized into 17 wallpaper groups. A tiling that lacks a repeating pattern is called "non-periodic". An aperiodic tiling uses a small set of tile shapes that cannot form a repeating pattern. A tessellation of space, also known as a space filling or honeycomb, can be defined in the geometry of higher dimensions. (Full article...)
• 

  A kite, showing its pairs of equal-length sides and its inscribed circle.

  
  In Euclidean geometry, a kite is a quadrilateral with reflection symmetry across a diagonal. Because of this symmetry, a kite has two equal angles and two pairs of adjacent equal-length sides. Kites are also known as deltoids, but the word deltoid may also refer to a deltoid curve, an unrelated geometric object sometimes studied in connection with quadrilaterals. A kite may also be called a dart, particularly if it is not convex.
  
  Every kite is an orthodiagonal quadrilateral (its diagonals are at right angles) and, when convex, a tangential quadrilateral (its sides are tangent to an inscribed circle). The convex kites are exactly the quadrilaterals that are both orthodiagonal and tangential. They include as special cases the right kites, with two opposite right angles; the rhombi, with two diagonal axes of symmetry; and the squares, which are also special cases of both right kites and rhombi. (Full article...)
• 

  

  A Penrose tiling with rhombi exhibiting fivefold symmetry

  
  A Penrose tiling is an example of an aperiodic tiling. Here, a tiling is a covering of the plane by non-overlapping polygons or other shapes, and aperiodic means that shifting any tiling with these shapes by any finite distance, without rotation, cannot produce the same tiling. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s.
  
  There are several different variations of Penrose tilings with different tile shapes. The original form of Penrose tiling used tiles of four different shapes, but this was later reduced to only two shapes: either two different rhombi, or two different quadrilaterals called kites and darts. The Penrose tilings are obtained by constraining the ways in which these shapes are allowed to fit together in a way that avoids periodic tiling. This may be done in several different ways, including matching rules, substitution tiling or finite subdivision rules, cut and project schemes, and coverings. Even constrained in this manner, each variation yields infinitely many different Penrose tilings. (Full article...)
• 

  

  Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is stretched by a factor of 2, yielding the sum v + 2w.

  
  
  In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, may be added together and multiplied ("scaled") by numbers called scalars. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space.
  
  Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities, such as forces and velocity, that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear equations. (Full article...)
• 

  

  The regular heptagon cannot be constructed using only a straightedge and compass construction; this can be proven using the field of constructible numbers.

  
  In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus a fundamental algebraic structure which is widely used in algebra, number theory, and many other areas of mathematics.
  
  The best known fields are the field of rational numbers, the field of real numbers and the field of complex numbers. Many other fields, such as fields of rational functions, algebraic function fields, algebraic number fields, and p-adic fields are commonly used and studied in mathematics, particularly in number theory and algebraic geometry. Most cryptographic protocols rely on finite fields, i.e., fields with finitely many elements. (Full article...)

Did you know (auto-generated) -

• ... that John Rolph was arrested while trying to solve Euclid's geometry problems?
• ... that Piper Harron's 2016 mathematics doctoral thesis has been described as "feminist", "unique", "honest", "generous", and "refreshing"?
• ... that the co-founder of Arkansas radio station KTOY, the first Black-owned radio station in the state, continued teaching math after starting it?
• ... that the Septet for trumpet, strings and piano was composed by Camille Saint-Saëns for a mathematician?
• ... that in the musical Fermat's Last Tango, mathematicians Euclid and Newton are played by women?
• ... that owner Matthew Benham influenced both Brentford FC in the UK and FC Midtjylland in Denmark to use mathematical modelling to recruit undervalued football players?
• ... that the 1914 Lubin vault fire in Philadelphia destroyed several thousand unique early silent films?
• ... that in 1593, French amateur mathematician François Viète found the first formula in European mathematics to represent an infinite process, a product of square roots that he used to compute π?

More did you know –

• ... 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?
• ... that no matter how biased a coin one uses, flipping a coin to determine whether each edge is present or absent in a countably infinite graph will always produce the same graph, the Rado graph?
• ...that it is possible to stack identical dominoes off the edge of a table to create an arbitrarily large overhang?

Selected article –

Problem II.8 in the Arithmetica by Diophantus, annotated with Fermat's comment, which became Fermat's Last Theorem Image credit:

Fermat's Last Theorem is one of the most famous theorems in the history of mathematics. It states that:

$a^{n}+b^{n}=c^{n}$ has no solutions in non-zero integers $a$, $b$, and $c$ when $n$ is an integer greater than 2.

Despite how closely the problem is related to the Pythagorean theorem, which has infinite solutions and hundreds of proofs, Fermat's subtle variation is much more difficult to prove. Still, the problem itself is easily understood even by schoolchildren, making it all the more frustrating and generating perhaps more incorrect proofs than any other problem in the history of mathematics.

The 17th-century mathematician Pierre de Fermat wrote in 1637 in his copy of Bachet's translation of the famous Arithmetica of Diophantus: "I have a truly marvelous proof of this proposition which this margin is too narrow to contain." However, no correct proof was found for 357 years, until it was finally proven using very deep methods by Andrew Wiles in 1995 (after a failed attempt a year before). (Full article...)

View all selected articles

Subcategories

Algebra | Arithmetic | Analysis | Complex analysis | Applied mathematics | Calculus | Category theory | Chaos theory | Combinatorics | Dynamical systems | Fractals | Game theory | Geometry | Algebraic geometry | Graph theory | Group theory | Linear algebra | Mathematical logic | Model theory | Multi-dimensional geometry | Number theory | Numerical analysis | Optimization | Order theory | Probability and statistics | Set theory | Statistics | Topology | Algebraic topology | Trigonometry | Linear programming

---

Mathematics | History of mathematics | Mathematicians | Awards | Education | Literature | Notation | Organizations | Theorems | Proofs | Unsolved problems

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

Mathematics

Mathematics by country

Fields of mathematics

Mathematics-related lists

Mathematicians

Works about mathematics

Mathematics and art

Mathematical classification systems

Mathematical concepts

Mathematical constants

Mathematics and culture

Mathematical examples

History of mathematics

Mathematical notation

Mathematical science occupations

Outlines of mathematics and logic

Philosophy of mathematics

Mathematical projects

Mathematical proofs

Pseudomathematics

Set index articles on mathematics

Mathematical terminology

Mathematical theorems

Mathematical tools

Mathematics stubs

Topics in mathematics

General	Foundations	Number theory	Discrete mathematics
Mathematicians History of mathematics Philosophy of mathematics Mathematical notation Mathematical beauties Mathematics education Areas of mathematics Outline of mathematics Glossary of mathematical symbols	Foundations of mathematics Mathematical logic Proof theory Gödel's incompleteness theorems Model theory Recursion theory Set theory Naive set theory Axiomatic set theory Category theory Topos theory	Number theory Algebraic number theory Analytic number theory Arithmetic Fundamental theorem of arithmetic Numbers Natural numbers Prime numbers Rational numbers Algebraic numbers	Discrete mathematics Combinatorics Combinatorial geometry Coding theory Combinatorial design Enumerative combinatorics Combinatorial optimization Graph theory Order theory Lattice theory Digital Signal Processing Theoretical computer science Computability theory Complexity theory
Algebra	Analysis	Geometry and topology	Applied mathematics
Algebra Elementary algebra Abstract algebra Group theory Ring theory Field theory Commutative algebra Geometric algebra Linear algebra Matrix theory Multilinear algebra Universal algebra Fundamental theorem of algebra	Analysis Calculus Fundamental theorem of calculus Vector calculus Geometric calculus Measure theory Real analysis Complex analysis Differential equations Ordinary differential equations Partial differential equations Integral equations Approximation theory Special functions Potential theory Harmonic analysis Fourier analysis Functional analysis Operator theory	Geometry Euclidean geometry Trigonometry Analytic geometry Non-Euclidean geometry Affine geometry Projective geometry Convex geometry Discrete geometry Algebraic geometry Differential geometry K theory Gauge theory Riemannian geometry Lie groups Topology General topology Algebraic topology Geometric topology Differential topology	Applied mathematics Mathematical modeling Mathematical physics Dynamical systems Control theory Calculus of variations Optimization Mathematical economics Game theory Mathematical finance Statistics Probability theory Stochastic processes Numerical analysis Cryptography Information theory

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

Related portals

WikiProjects

The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.

Project pages

• Participants
• Current activity
• Manual of style
• Conventions

Essays

• Advice on using Wikipedia for mathematics self-study
• Proofs

Subprojects

• PlanetMath Exchange (Talk)
• Graphics (Talk)
• Article assessment (Talk)

Related projects

Computer science | Cryptography | Game theory | Numbers | Physics | Science | Statistics

Things you can do

• Create a new article: List of requested articles
• Add a new image: Image requests
• Expand an article: Mathematics stubs
• Lend your expertise: Expert attention needed

In other Wikimedia projects

The following Wikimedia Foundation sister projects provide more on this subject:

• 
  Commons
  Free media repository
• 
  Wikibooks
  Free textbooks and manuals
• 
  Wikidata
  Free knowledge base
• 
  Wikinews
  Free-content news
• 
  Wikiquote
  Collection of quotations
• 
  Wikisource
  Free-content library
• 
  Wikiversity
  Free learning tools
• 
  Wiktionary
  Dictionary and thesaurus

More portals

Discover Wikipedia using portals

• 
  List of all portals
• 
  The arts portal
• 
  Biography portal
• 
  Current events portal
• 
  Geography portal
• 
  History portal
• 
  Mathematics portal
• 
  Science portal
• 
  Society portal
• 
  Technology portal
• 
  Random portal
• 
  WikiProject Portals