Portal:Mathematics

Page semi-protected
From Wikipedia, the free encyclopedia

Portal topics
Activities
Culture
Geography
Health
History
Mathematics
Nature
People
Philosophy
Religion
Society
Technology
Random portal
edit 

The Mathematics Portal

Shortcuts

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 – load new batch

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

Selected image – show another

animation of the act of "unrolling" a circle's circumference, illustrating the ratio pi (π)
animation of the act of "unrolling" a circle's circumference, illustrating the ratio pi (π)
Credit: John Reid
Pi, represented by the Greek letter π, is a mathematical constant whose value is the ratio of any circle's circumference to its diameter in Euclidean space (i.e., on a flat plane); it is also the ratio of a circle's area to the square of its radius. (These facts are reflected in the familiar formulas from geometry, C = π d and A = π r2.) In this animation, the circle has a diameter of 1 unit, giving it a circumference of π. The rolling shows that the distance a point on the circle moves linearly in one complete revolution is equal to π. Pi is an irrational number and so cannot be expressed as the ratio of two integers; as a result, the decimal expansion of π is nonterminating and nonrepeating. To 50 decimal places, π ≈ 3.14159 26535 89793 23846 26433 83279 50288 41971 69399 37510, a value of sufficient precision to allow the calculation of the volume of a sphere the size of the orbit of Neptune around the Sun (assuming an exact value for this radius) to within 1 cubic angstrom. According to the Lindemann–Weierstrass theorem, first proved in 1882, π is also a transcendental (or non-algebraic) number, meaning it is not the root of any non-zero polynomial with rational coefficients. (This implies that it cannot be expressed using any closed-form algebraic expression—and also that solving the ancient problem of squaring the circle using a compass and straightedge construction is impossible). Perhaps the simplest non-algebraic closed-form expression for π is 4 arctan 1, based on the inverse tangent function (a transcendental function). There are also many infinite series and some infinite products that converge to π or to a simple function of it, like 2/π; one of these is the infinite series representation of the inverse-tangent expression just mentioned. Such iterative approaches to approximating π first appeared in 15th-century India and were later rediscovered (perhaps not independently) in 17th- and 18th-century Europe (along with several continued fractions representations). Although these methods often suffer from an impractically slow convergence rate, one modern infinite series that converges to 1/π very quickly is given by the Chudnovsky algorithm, first published in 1989; each term of this series gives an astonishing 14 additional decimal places of accuracy. In addition to geometry and trigonometry, π appears in many other areas of mathematics, including number theory, calculus, and probability.

Good articles – load new batch

  These are Good articles, which meet a core set of high editorial standards.
  • Image 1 Fermat's Last Tango is a 2000 off-Broadway musical about the proof of Fermat's Last Theorem, written by husband and wife Joshua Rosenblum (music, lyrics) and Joanne Sydney Lessner (book, lyrics). The musical presents a fictionalized version of the real life story of Andrew Wiles, and has been praised for the accuracy of the mathematical content. The original production at the York Theatre received mixed reviews, but the musical was well received by mathematical audiences. A video of the original production has been distributed by the Clay Mathematics Institute and shown at several mathematical conferences and similar occasions. The musical has also been translated into Portuguese. (Full article...)
    Fermat's Last Tango is a 2000 off-Broadway musical about the proof of Fermat's Last Theorem, written by husband and wife Joshua Rosenblum (music, lyrics) and Joanne Sydney Lessner (book, lyrics). The musical presents a fictionalized version of the real life story of Andrew Wiles, and has been praised for the accuracy of the mathematical content. The original production at the York Theatre received mixed reviews, but the musical was well received by mathematical audiences. A video of the original production has been distributed by the Clay Mathematics Institute and shown at several mathematical conferences and similar occasions. The musical has also been translated into Portuguese. (Full article...)
  • Image 2 A Doyle spiral of type (8,16) printed in 1911 in Popular Science as an illustration of phyllotaxis. One of its spiral arms is shaded. In the mathematics of circle packing, a Doyle spiral is a pattern of non-crossing circles in the plane in which each circle is surrounded by a ring of six tangent circles. These patterns contain spiral arms formed by circles linked through opposite points of tangency, with their centers on logarithmic spirals of three different shapes. Doyle spirals are named after mathematician Peter G. Doyle, who made an important contribution to their mathematical construction in the late 1980s or early 1990s. However, their study in phyllotaxis (the mathematics of plant growth) dates back to the early 1900s. (Full article...)
    A Doyle spiral of type (8,16) printed in 1911 in Popular Science as an illustration of phyllotaxis. One of its spiral arms is shaded.

    In the mathematics of circle packing, a Doyle spiral is a pattern of non-crossing circles in the plane in which each circle is surrounded by a ring of six tangent circles. These patterns contain spiral arms formed by circles linked through opposite points of tangency, with their centers on logarithmic spirals of three different shapes.

    Doyle spirals are named after mathematician Peter G. Doyle, who made an important contribution to their mathematical construction in the late 1980s or early 1990s. However, their study in phyllotaxis (the mathematics of plant growth) dates back to the early 1900s. (Full article...)
  • Image 3 Klaus Friedrich Roth FRS (29 October 1925 – 10 November 2015) was a German-born British mathematician who won the Fields Medal for proving Roth's theorem on the Diophantine approximation of algebraic numbers. He was also a winner of the De Morgan Medal and the Sylvester Medal, and a Fellow of the Royal Society. Roth moved to England as a child in 1933 to escape the Nazis, and was educated at the University of Cambridge and University College London, finishing his doctorate in 1950. He taught at University College London until 1966, when he took a chair at Imperial College London. He retired in 1988. (Full article...)
    Klaus Friedrich Roth FRS (29 October 1925 – 10 November 2015) was a German-born British mathematician who won the Fields Medal for proving Roth's theorem on the Diophantine approximation of algebraic numbers. He was also a winner of the De Morgan Medal and the Sylvester Medal, and a Fellow of the Royal Society.

    Roth moved to England as a child in 1933 to escape the Nazis, and was educated at the University of Cambridge and University College London, finishing his doctorate in 1950. He taught at University College London until 1966, when he took a chair at Imperial College London. He retired in 1988. (Full article...)
  • Image 4 An ideal regular octahedron in the Poincaré ball model of hyperbolic space (sphere at infinity not shown). All dihedral angles of this shape are right angles. In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space. The Platonic solids and Archimedean solids have ideal versions, with the same combinatorial structure as their more familiar Euclidean versions. Several uniform hyperbolic honeycombs divide hyperbolic space into cells of these shapes, much like the familiar division of Euclidean space into cubes. However, not all polyhedra can be represented as ideal polyhedra – a polyhedron can be ideal only when it can be represented in Euclidean geometry with all its vertices on a circumscribed sphere. Using linear programming, it is possible to test whether a given polyhedron has an ideal version, in polynomial time. (Full article...)

    An ideal regular octahedron in the Poincaré ball model of hyperbolic space (sphere at infinity not shown). All dihedral angles of this shape are right angles.

    In three-dimensional hyperbolic geometry, an ideal polyhedron is a convex polyhedron all of whose vertices are ideal points, points "at infinity" rather than interior to three-dimensional hyperbolic space. It can be defined as the convex hull of a finite set of ideal points. An ideal polyhedron has ideal polygons as its faces, meeting along lines of the hyperbolic space.

    The Platonic solids and Archimedean solids have ideal versions, with the same combinatorial structure as their more familiar Euclidean versions. Several uniform hyperbolic honeycombs divide hyperbolic space into cells of these shapes, much like the familiar division of Euclidean space into cubes. However, not all polyhedra can be represented as ideal polyhedra – a polyhedron can be ideal only when it can be represented in Euclidean geometry with all its vertices on a circumscribed sphere. Using linear programming, it is possible to test whether a given polyhedron has an ideal version, in polynomial time. (Full article...)
  • Image 5 The convex hull of the red set is the blue and red convex set. In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset. Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points. The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of computational geometry. They can be solved in time '"`UNIQ--postMath-00000004-QINU`"' for two or three dimensional point sets, and in time matching the worst-case output complexity given by the upper bound theorem in higher dimensions. (Full article...)
    The convex hull of the red set is the blue and red convex set.

    In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.

    Convex hulls of open sets are open, and convex hulls of compact sets are compact. Every compact convex set is the convex hull of its extreme points. The convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of points.
    The algorithmic problems of finding the convex hull of a finite set of points in the plane or other low-dimensional Euclidean spaces, and its dual problem of intersecting half-spaces, are fundamental problems of computational geometry. They can be solved in time for two or three dimensional point sets, and in time matching the worst-case output complexity given by the upper bound theorem in higher dimensions. (Full article...)
  • Image 6 The integer number line, a set of infinitely many points with integer distances. According to the Erdős–Anning theorem, any such set lies on a line. The Erdős–Anning theorem states that, whenever an infinite number of points in the plane all have integer distances, the points lie on a straight line. The same result holds in higher dimensional Euclidean spaces. The theorem cannot be strengthened to give a finite bound on the number of points: there exist arbitrarily large finite sets of points that are not on a line and have integer distances. The theorem is named after Paul Erdős and Norman H. Anning, who published a proof of it in 1945. Erdős later supplied a simpler proof, which can also be used to check whether a point set forms an Erdős–Diophantine graph, an inextensible system of integer points with integer distances. The Erdős–Anning theorem inspired the Erdős–Ulam problem on the existence of dense point sets with rational distances. (Full article...)
    The integer number line, a set of infinitely many points with integer distances. According to the Erdős–Anning theorem, any such set lies on a line.

    The Erdős–Anning theorem states that, whenever an infinite number of points in the plane all have integer distances, the points lie on a straight line. The same result holds in higher dimensional Euclidean spaces.
    The theorem cannot be strengthened to give a finite bound on the number of points: there exist arbitrarily large finite sets of points that are not on a line and have integer distances.

    The theorem is named after Paul Erdős and Norman H. Anning, who published a proof of it in 1945. Erdős later supplied a simpler proof, which can also be used to check whether a point set forms an Erdős–Diophantine graph, an inextensible system of integer points with integer distances. The Erdős–Anning theorem inspired the Erdős–Ulam problem on the existence of dense point sets with rational distances. (Full article...)
  • Image 7 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. 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...)
    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.

    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 8 Six points in the unit square, with the smallest triangles (red) having area 1/8, the optimal area for this number of points. Other larger triangles are colored blue. These points are an affine transformation of a regular hexagon, but for larger numbers of points the optimal solution does not form a convex polygon. In discrete geometry and discrepancy theory, the Heilbronn triangle problem is a problem of placing points in the plane, avoiding triangles of small area. It is named after Hans Heilbronn, who conjectured that, no matter how points are placed in a given area, the smallest triangle area will be at most inversely proportional to the square of the number of points. His conjecture was proven false, but the asymptotic growth rate of the minimum triangle area remains unknown. (Full article...)
    Six points in the unit square, with the smallest triangles (red) having area 1/8, the optimal area for this number of points. Other larger triangles are colored blue. These points are an affine transformation of a regular hexagon, but for larger numbers of points the optimal solution does not form a convex polygon.

    In discrete geometry and discrepancy theory, the Heilbronn triangle problem is a problem of placing points in the plane, avoiding triangles of small area. It is named after Hans Heilbronn, who conjectured that, no matter how points are placed in a given area, the smallest triangle area will be at most inversely proportional to the square of the number of points. His conjecture was proven false, but the asymptotic growth rate of the minimum triangle area remains unknown. (Full article...)
  • Image 9 69 (sixty-nine; LXIX) is the natural number following 68 and preceding 70. An odd number and a composite number, 69 is divisible by 1, 3, 23 and 69. 69 is a semiprime because it is a natural number that is the product of exactly two prime numbers (3 and 23), and an interprime between the numbers of 67 and 71. Because 69 is not divisible by any square number other than 1, it is categorised as a square-free integer. 69 is also a Blum integer since the two factors of 69 are both Gaussian primes. In number theory, 69 is a deficient number, arithmetic number and a congruent number. In reference to 69ing, a sex position in which two partners align themselves to simultaneously achieve oral sex, the number 69 itself has become an Internet meme as an inherently funny number in which users will respond to any occurrence of the number with the word "nice" to draw specific attention to it. Because of its association with the sex position and resulting meme, 69 has been humorously named "the sex number". (Full article...)
    69 (sixty-nine; LXIX) is the natural number following 68 and preceding 70. An odd number and a composite number, 69 is divisible by 1, 3, 23 and 69. 69 is a semiprime because it is a natural number that is the product of exactly two prime numbers (3 and 23), and an interprime between the numbers of 67 and 71. Because 69 is not divisible by any square number other than 1, it is categorised as a square-free integer. 69 is also a Blum integer since the two factors of 69 are both Gaussian primes. In number theory, 69 is a deficient number, arithmetic number and a congruent number.

    In reference to 69ing, a sex position in which two partners align themselves to simultaneously achieve oral sex, the number 69 itself has become an Internet meme as an inherently funny number in which users will respond to any occurrence of the number with the word "nice" to draw specific attention to it. Because of its association with the sex position and resulting meme, 69 has been humorously named "the sex number". (Full article...)
  • Image 10 Srinivasa Ramanujan (22 December 1887 – 26 April 1920) was an Indian mathematician. Though he had almost no formal training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then considered unsolvable. Ramanujan initially developed his own mathematical research in isolation. According to Hans Eysenck, "he tried to interest the leading professional mathematicians in his work, but failed for the most part. What he had to show them was too novel, too unfamiliar, and additionally presented in unusual ways; they could not be bothered". Seeking mathematicians who could better understand his work, in 1913 he began a mail correspondence with the English mathematician G. H. Hardy at the University of Cambridge, England. Recognising Ramanujan's work as extraordinary, Hardy arranged for him to travel to Cambridge. In his notes, Hardy commented that Ramanujan had produced groundbreaking new theorems, including some that "defeated me completely; I had never seen anything in the least like them before", and some recently proven but highly advanced results. (Full article...)

    Srinivasa Ramanujan
    (22 December 1887 – 26 April 1920) was an Indian mathematician. Though he had almost no formal training in pure mathematics, he made substantial contributions to mathematical analysis, number theory, infinite series, and continued fractions, including solutions to mathematical problems then considered unsolvable.

    Ramanujan initially developed his own mathematical research in isolation. According to Hans Eysenck, "he tried to interest the leading professional mathematicians in his work, but failed for the most part. What he had to show them was too novel, too unfamiliar, and additionally presented in unusual ways; they could not be bothered". Seeking mathematicians who could better understand his work, in 1913 he began a mail correspondence with the English mathematician G. H. Hardy at the University of Cambridge, England. Recognising Ramanujan's work as extraordinary, Hardy arranged for him to travel to Cambridge. In his notes, Hardy commented that Ramanujan had produced groundbreaking new theorems, including some that "defeated me completely; I had never seen anything in the least like them before", and some recently proven but highly advanced results. (Full article...)
  • Image 11 Rule 184, run for 128 steps from random configurations with each of three different starting densities: top 25%, middle 50%, bottom 75%. The view shown is a 300-pixel crop from a wider simulation. Rule 184 is a one-dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems: Rule 184 can be used as a simple model for traffic flow in a single lane of a highway, and forms the basis for many cellular automaton models of traffic flow with greater sophistication. In this model, particles (representing vehicles) move in a single direction, stopping and starting depending on the cars in front of them. The number of particles remains unchanged throughout the simulation. Because of this application, Rule 184 is sometimes called the "traffic rule". Rule 184 also models a form of deposition of particles onto an irregular surface, in which each local minimum of the surface is filled with a particle in each step. At each step of the simulation, the number of particles increases. Once placed, a particle never moves. Rule 184 can be understood in terms of ballistic annihilation, a system of particles moving both leftwards and rightwards through a one-dimensional medium. When two such particles collide, they annihilate each other, so that at each step the number of particles remains unchanged or decreases. The apparent contradiction between these descriptions is resolved by different ways of associating features of the automaton's state with particles. (Full article...)
    Rule 184, run for 128 steps from random configurations with each of three different starting densities: top 25%, middle 50%, bottom 75%. The view shown is a 300-pixel crop from a wider simulation.

    Rule 184 is a one-dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems:
    • Rule 184 can be used as a simple model for traffic flow in a single lane of a highway, and forms the basis for many cellular automaton models of traffic flow with greater sophistication. In this model, particles (representing vehicles) move in a single direction, stopping and starting depending on the cars in front of them. The number of particles remains unchanged throughout the simulation. Because of this application, Rule 184 is sometimes called the "traffic rule".
    • Rule 184 also models a form of deposition of particles onto an irregular surface, in which each local minimum of the surface is filled with a particle in each step. At each step of the simulation, the number of particles increases. Once placed, a particle never moves.
    • Rule 184 can be understood in terms of ballistic annihilation, a system of particles moving both leftwards and rightwards through a one-dimensional medium. When two such particles collide, they annihilate each other, so that at each step the number of particles remains unchanged or decreases.

    The apparent contradiction between these descriptions is resolved by different ways of associating features of the automaton's state with particles. (Full article...)
  • Image 12 The derivative is a fundamental tool of calculus that quantifies the sensitivity of change of a function's output with respect to its input. The derivative of a function of a single variable at a chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation of the function near that input value. For this reason, the derivative is often described as the instantaneous rate of change, the ratio of the instantaneous change in the dependent variable to that of the independent variable. The process of finding a derivative is called differentiation. There are multiple different notations for differentiation, two of the most commonly used being Leibniz notation and prime notation. Leibniz notation, named after Gottfried Wilhelm Leibniz, is represented as the ratio of two differentials, whereas prime notation is written by adding a prime mark. Higher order notations represent repeated differentiation, and they are usually denoted in Leibniz notation by adding superscripts to the differentials, and in prime notation by adding additional prime marks. The higher order derivatives can be applied in physics; for example, while the first derivative of the position of a moving object with respect to time is the object's velocity, how the position changes as time advances, the second derivative is the object's acceleration, how the velocity changes as time advances. (Full article...)
    The derivative is a fundamental tool of calculus that quantifies the sensitivity of change of a function's output with respect to its input. The derivative of a function of a single variable at a chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation of the function near that input value. For this reason, the derivative is often described as the instantaneous rate of change, the ratio of the instantaneous change in the dependent variable to that of the independent variable. The process of finding a derivative is called differentiation.

    There are multiple different notations for differentiation, two of the most commonly used being Leibniz notation and prime notation. Leibniz notation, named after Gottfried Wilhelm Leibniz, is represented as the ratio of two differentials, whereas prime notation is written by adding a prime mark. Higher order notations represent repeated differentiation, and they are usually denoted in Leibniz notation by adding superscripts to the differentials, and in prime notation by adding additional prime marks. The higher order derivatives can be applied in physics; for example, while the first derivative of the position of a moving object with respect to time is the object's velocity, how the position changes as time advances, the second derivative is the object's acceleration, how the velocity changes as time advances. (Full article...)
More good articles

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

  • ... that circle packings in the form of a Doyle spiral were used to model plant growth long before their mathematical investigation by Doyle?
  • ... 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 Arithmetic was the first mathematics text book written in the Russian language?
  • ... that according to one critic, the math rock album Cryptooology by Yowie "sounds like an explosion in a Slinky factory"?
  • ... that The Math Myth advocates for American high schools to stop requiring advanced algebra?
  • ... that ten-sided gaming dice have kite-shaped faces?
  • ... that museum director Alena Aladava rebuilt the Belarusian national art collection in the aftermath of the Second World War?
  • ... that the discovery of Descartes' theorem in geometry came from a too-difficult mathematics problem posed to a princess?
edit 

More did you know – view different entries

Did you know...
Did you know...
More did you know facts
Showing 7 items out of 75
edit 

Selected article – show another


In search of a new car, the player picks door 1. The game host then opens door 3 to reveal a goat and offers to let the player pick door 2 instead of door 1.
Image credit: Cepheus

The Monty Hall problem is a puzzle involving probability similar to the American game show Let's Make a Deal. The name comes from the show's host, Monty Hall. A widely known, but problematic (see below) statement of the problem is from Craig F. Whitaker of Columbia, Maryland in a letter to Marilyn vos Savant's September 9, 1990, column in Parade Magazine (as quoted by Bohl, Liberatore, and Nydick).

Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice?

The problem is also called the Monty Hall paradox; it is a veridical paradox in the sense that the solution is counterintuitive, although the problem does not yield a logical contradiction. (Full article...)

View all selected articles
edit 

Subcategories

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
Eponyms in mathematics
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
More mathematics categories
edit 

Topics in mathematics

General Foundations Number theory Discrete mathematics


Algebra Analysis Geometry and topology Applied mathematics
Source
edit 

Index of mathematics articles

ARTICLE INDEX:
MATHEMATICIANS:
edit 

Related portals

edit 

WikiProjects

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

In other Wikimedia projects

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

More portals

Retrieved from "https://en.wikipedia.org/w/index.php?title=Portal:Mathematics&oldid=1158081156"