Jump to content

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 are displayed here, which represent some of the best content on English Wikipedia.
More featured articles
edit 

Selected image – show another

three double-cones cut by planes in different ways, resulting in the four conic sections
three double-cones cut by planes in different ways, resulting in the four conic sections
The four conic sections arise when a plane cuts through a double cone in different ways. If the plane cuts through parallel to the side of the cone (case 1), a parabola results (to be specific, the parabola is the shape of the planar graph that is formed by the set of points of intersection of the plane and the cone). If the plane is perpendicular to the cone's axis of symmetry (case 2, lower plane), a circle results. If the plane cuts through at some angle between these two cases (case 2, upper plane) — that is, if the angle between the plane and the axis of symmetry is larger than that between the side of the cone and the axis, but smaller than a right angle — an ellipse results. If the plane is parallel to the axis of symmetry (case 3), or makes a smaller positive angle with the axis than the side of the cone does (not shown), a hyperbola results. In all of these cases, if the plane passes through the point at which the two cones meet (the vertex), a degenerate conic results. First studied by the ancient Greeks in the 4th century BCE, conic sections were still considered advanced mathematics by the time Euclid (fl. c. 300 BCE) created his Elements, and so do not appear in that famous work. Euclid did write a work on conics, but it was lost after Apollonius of Perga (d. c. 190 BCE) collected the same information and added many new results in his Conics. Other important results on conics were discovered by the medieval Persian mathematician Omar Khayyám (d. 1131 CE), who used conic sections to solve algebraic equations.

Good articles – load new batch

  These are Good articles, which meet a core set of high editorial standards.
  • Image 1 L6a4 In mathematics, the Borromean rings are three simple closed curves in three-dimensional space that are topologically linked and cannot be separated from each other, but that break apart into two unknotted and unlinked loops when any one of the three is cut or removed. Most commonly, these rings are drawn as three circles in the plane, in the pattern of a Venn diagram, alternatingly crossing over and under each other at the points where they cross. Other triples of curves are said to form the Borromean rings as long as they are topologically equivalent to the curves depicted in this drawing. The Borromean rings are named after the Italian House of Borromeo, who used the circular form of these rings as an element of their coat of arms, but designs based on the Borromean rings have been used in many cultures, including by the Norsemen and in Japan. They have been used in Christian symbolism as a sign of the Trinity, and in modern commerce as the logo of Ballantine beer, giving them the alternative name Ballantine rings. Physical instances of the Borromean rings have been made from linked DNA or other molecules, and they have analogues in the Efimov state and Borromean nuclei, both of which have three components bound to each other although no two of them are bound. (Full article...)

    L6a4

    In mathematics, the Borromean rings are three simple closed curves in three-dimensional space that are topologically linked and cannot be separated from each other, but that break apart into two unknotted and unlinked loops when any one of the three is cut or removed. Most commonly, these rings are drawn as three circles in the plane, in the pattern of a Venn diagram, alternatingly crossing over and under each other at the points where they cross. Other triples of curves are said to form the Borromean rings as long as they are topologically equivalent to the curves depicted in this drawing.

    The Borromean rings are named after the Italian House of Borromeo, who used the circular form of these rings as an element of their coat of arms, but designs based on the Borromean rings have been used in many cultures, including by the Norsemen and in Japan. They have been used in Christian symbolism as a sign of the Trinity, and in modern commerce as the logo of Ballantine beer, giving them the alternative name Ballantine rings. Physical instances of the Borromean rings have been made from linked DNA or other molecules, and they have analogues in the Efimov state and Borromean nuclei, both of which have three components bound to each other although no two of them are bound. (Full article...)
  • Image 2 Two greedy colorings of the same crown graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors. In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings can be found in linear time, but they do not, in general, use the minimum number of colors possible. Different choices of the sequence of vertices will typically produce different colorings of the given graph, so much of the study of greedy colorings has concerned how to find a good ordering. There always exists an ordering that produces an optimal coloring, but although such orderings can be found for many special classes of graphs, they are hard to find in general. Commonly used strategies for vertex ordering involve placing higher-degree vertices earlier than lower-degree vertices, or choosing vertices with fewer available colors in preference to vertices that are less constrained. (Full article...)
    Two greedy colorings of the same crown graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors.

    In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings can be found in linear time, but they do not, in general, use the minimum number of colors possible.

    Different choices of the sequence of vertices will typically produce different colorings of the given graph, so much of the study of greedy colorings has concerned how to find a good ordering. There always exists an ordering that produces an optimal coloring, but although such orderings can be found for many special classes of graphs, they are hard to find in general. Commonly used strategies for vertex ordering involve placing higher-degree vertices earlier than lower-degree vertices, or choosing vertices with fewer available colors in preference to vertices that are less constrained. (Full article...)
  • Image 3 Fibonacci nim is played with a pile of coins. The number of coins in this pile, 21, is a Fibonacci number, so a game starting with this pile and played optimally will be won by the second player. Fibonacci nim is a mathematical subtraction game, a variant of the game of nim. Players alternate removing coins from a pile, on each move taking at most twice as many coins as the previous move, and winning by taking the last coin. The Fibonacci numbers feature heavily in its analysis; in particular, the first player can win if and only if the starting number of coins is not a Fibonacci number. A complete strategy is known for best play in games with a single pile of counters, but not for variants of the game with multiple piles. (Full article...)
    Fibonacci nim is played with a pile of coins. The number of coins in this pile, 21, is a Fibonacci number, so a game starting with this pile and played optimally will be won by the second player.

    Fibonacci nim is a mathematical subtraction game, a variant of the game of nim. Players alternate removing coins from a pile, on each move taking at most twice as many coins as the previous move, and winning by taking the last coin. The Fibonacci numbers feature heavily in its analysis; in particular, the first player can win if and only if the starting number of coins is not a Fibonacci number. A complete strategy is known for best play in games with a single pile of counters, but not for variants of the game with multiple piles. (Full article...)
  • Image 4 An anti­parallelogram In geometry, an antiparallelogram is a type of self-crossing quadrilateral. Like a parallelogram, an antiparallelogram has two opposite pairs of equal-length sides, but these pairs of sides are not in general parallel. Instead, each pair of sides is antiparallel with respect to the other, with sides in the longer pair crossing each other as in a scissors mechanism. Whereas a parallelogram's opposite angles are equal and oriented the same way, an antiparallelogram's are equal but oppositely oriented. Antiparallelograms are also called contraparallelograms or crossed parallelograms. Antiparallelograms occur as the vertex figures of certain nonconvex uniform polyhedra. In the theory of four-bar linkages, the linkages with the form of an antiparallelogram are also called butterfly linkages or bow-tie linkages, and are used in the design of non-circular gears. In celestial mechanics, they occur in certain families of solutions to the 4-body problem. (Full article...)
    An anti­parallelogram


    In geometry, an antiparallelogram is a type of self-crossing quadrilateral. Like a parallelogram, an antiparallelogram has two opposite pairs of equal-length sides, but these pairs of sides are not in general parallel. Instead, each pair of sides is antiparallel with respect to the other, with sides in the longer pair crossing each other as in a scissors mechanism. Whereas a parallelogram's opposite angles are equal and oriented the same way, an antiparallelogram's are equal but oppositely oriented. Antiparallelograms are also called contraparallelograms or crossed parallelograms.

    Antiparallelograms occur as the vertex figures of certain nonconvex uniform polyhedra. In the theory of four-bar linkages, the linkages with the form of an antiparallelogram are also called butterfly linkages or bow-tie linkages, and are used in the design of non-circular gears. In celestial mechanics, they occur in certain families of solutions to the 4-body problem. (Full article...)
  • Image 5 In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances. Equivalently, every homomorphism from the unit distance graph of the plane to itself must be an isometry of the plane. The theorem is named after Frank S. Beckman and Donald A. Quarles Jr., who published this result in 1953; it was later rediscovered by other authors and re-proved in multiple ways. Analogous theorems for rational subsets of Euclidean spaces, or for non-Euclidean geometry, are also known. (Full article...)
    In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances. Equivalently, every homomorphism from the unit distance graph of the plane to itself must be an isometry of the plane. The theorem is named after Frank S. Beckman and Donald A. Quarles Jr., who published this result in 1953; it was later rediscovered by other authors and re-proved in multiple ways. Analogous theorems for rational subsets of Euclidean spaces, or for non-Euclidean geometry, are also known. (Full article...)
  • Image 6 Fig. 1: A binary search tree of size 9 and depth 3, with 8 at the root. In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is linear with respect to the height of the tree. Binary search trees allow binary search for fast lookup, addition, and removal of data items. Since the nodes in a BST are laid out so that each comparison skips about half of the remaining tree, the lookup performance is proportional to that of binary logarithm. BSTs were devised in the 1960s for the problem of efficient storage of labeled data and are attributed to Conway Berners-Lee and David Wheeler. (Full article...)
    Fig. 1: A binary search tree of size 9 and depth 3, with 8 at the root.


    In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is linear with respect to the height of the tree.

    Binary search trees allow binary search for fast lookup, addition, and removal of data items. Since the nodes in a BST are laid out so that each comparison skips about half of the remaining tree, the lookup performance is proportional to that of binary logarithm. BSTs were devised in the 1960s for the problem of efficient storage of labeled data and are attributed to Conway Berners-Lee and David Wheeler. (Full article...)
  • Image 7 Bust of Pythagoras of Samos in the Capitoline Museums, Rome Pythagoras of Samos (Ancient Greek: Πυθαγόρας; c. 570 – c. 495 BC) was an ancient Ionian Greek philosopher, polymath, and the eponymous founder of Pythagoreanism. His political and religious teachings were well known in Magna Graecia and influenced the philosophies of Plato, Aristotle, and, through them, the West in general. Knowledge of his life is clouded by legend; modern scholars disagree regarding Pythagoras's education and influences, but they do agree that, around 530 BC, he travelled to Croton in southern Italy, where he founded a school in which initiates were sworn to secrecy and lived a communal, ascetic lifestyle. In antiquity, Pythagoras was credited with many mathematical and scientific discoveries, including the Pythagorean theorem, Pythagorean tuning, the five regular solids, the Theory of Proportions, the sphericity of the Earth, and the identity of the morning and evening stars as the planet Venus. It was said that he was the first man to call himself a philosopher ("lover of wisdom") and that he was the first to divide the globe into five climatic zones. Classical historians debate whether Pythagoras made these discoveries, and many of the accomplishments credited to him likely originated earlier or were made by his colleagues or successors. Some accounts mention that the philosophy associated with Pythagoras was related to mathematics and that numbers were important, but it is debated to what extent, if at all, he actually contributed to mathematics or natural philosophy. (Full article...)

    Bust of Pythagoras of Samos in the
    Capitoline Museums, Rome

    Pythagoras of Samos (Ancient Greek: Πυθαγόρας; c. 570 – c. 495 BC) was an ancient Ionian Greek philosopher, polymath, and the eponymous founder of Pythagoreanism. His political and religious teachings were well known in Magna Graecia and influenced the philosophies of Plato, Aristotle, and, through them, the West in general. Knowledge of his life is clouded by legend; modern scholars disagree regarding Pythagoras's education and influences, but they do agree that, around 530 BC, he travelled to Croton in southern Italy, where he founded a school in which initiates were sworn to secrecy and lived a communal, ascetic lifestyle.

    In antiquity, Pythagoras was credited with many mathematical and scientific discoveries, including the Pythagorean theorem, Pythagorean tuning, the five regular solids, the Theory of Proportions, the sphericity of the Earth, and the identity of the morning and evening stars as the planet Venus. It was said that he was the first man to call himself a philosopher ("lover of wisdom") and that he was the first to divide the globe into five climatic zones. Classical historians debate whether Pythagoras made these discoveries, and many of the accomplishments credited to him likely originated earlier or were made by his colleagues or successors. Some accounts mention that the philosophy associated with Pythagoras was related to mathematics and that numbers were important, but it is debated to what extent, if at all, he actually contributed to mathematics or natural philosophy. (Full article...)
  • Image 8 The Shapley–Folkman lemma is illustrated by the Minkowski addition of four sets. The point (+) in the convex hull of the Minkowski sum of the four non-convex sets (right) is the sum of four points (+) from the (left-hand) sets—two points in two non-convex sets plus two points in the convex hulls of two sets. The convex hulls are shaded pink. The original sets each have exactly two points (shown as red dots). The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. It is named after mathematicians Lloyd Shapley and Jon Folkman, but was first published by the economist Ross M. Starr. The lemma may be intuitively understood as saying that, if the number of summed sets exceeds the dimension of the vector space, then their Minkowski sum is approximately convex. (Full article...)
    The Shapley–Folkman lemma depicted by a diagram with two panes, one on the left and the other on the right. The left-hand pane displays four sets, which are displayed in a two-by-two array. Each of the sets contains exactly two points, which are displayed in red. In each set, the two points are joined by a pink line-segment, which is the convex hull of the original set. Each set has exactly one point that is indicated with a plus-symbol. In the top row of the two-by-two array, the plus-symbol lies in the interior of the line segment; in the bottom row, the plus-symbol coincides with one of the red-points. This completes the description of the left-hand pane of the diagram. The right-hand pane displays the Minkowski sum of the sets, which is the union of the sums having exactly one point from each summand-set; for the displayed sets, the sixteen sums are distinct points, which are displayed in red: The right-hand red sum-points are the sums of the left-hand red summand-points. The convex hull of the sixteen red-points is shaded in pink. In the pink interior of the right-hand sumset lies exactly one plus-symbol, which is the (unique) sum of the plus-symbols from the right-hand side. Comparing the left array and the right pane, one confirms that the right-hand plus-symbol is indeed the sum of the four plus-symbols from the left-hand sets, precisely two points from the original non-convex summand-sets and two points from the convex hulls of the remaining summand-sets.
    The Shapley–Folkman lemma is illustrated by the Minkowski addition of four sets. The point (+) in the convex hull of the Minkowski sum of the four non-convex sets (right) is the sum of four points (+) from the (left-hand) sets—two points in two non-convex sets plus two points in the convex hulls of two sets. The convex hulls are shaded pink. The original sets each have exactly two points (shown as red dots).

    The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. It is named after mathematicians Lloyd Shapley and Jon Folkman, but was first published by the economist Ross M. Starr.

    The lemma may be intuitively understood as saying that, if the number of summed sets exceeds the dimension of the vector space, then their Minkowski sum is approximately convex. (Full article...)
  • Image 9 A 1933 portrait of Whittaker by Arthur Trevor Haddon titled Sir Edmund Taylor Whittaker Sir Edmund Taylor Whittaker FRS FRSE (24 October 1873 – 24 March 1956) was a British mathematician, physicist, and historian of science. Whittaker was a leading mathematical scholar of the early 20th century who contributed widely to applied mathematics and was renowned for his research in mathematical physics and numerical analysis, including the theory of special functions, along with his contributions to astronomy, celestial mechanics, the history of physics, and digital signal processing. Among the most influential publications in Whittaker's bibliography, he authored several popular reference works in mathematics, physics, and the history of science, including A Course of Modern Analysis (better known as Whittaker and Watson), Analytical Dynamics of Particles and Rigid Bodies, and A History of the Theories of Aether and Electricity. Whittaker is also remembered for his role in the relativity priority dispute, as he credited Henri Poincaré and Hendrik Lorentz with developing special relativity in the second volume of his History, a dispute which has lasted several decades, though scientific consensus has remained with Einstein. Whittaker served as the Royal Astronomer of Ireland early in his career, a position he held from 1906 through 1912, before moving on to the chair of mathematics at the University of Edinburgh for the next three decades and, towards the end of his career, received the Copley Medal and was knighted. The School of Mathematics of the University of Edinburgh holds The Whittaker Colloquium, a yearly lecture, in his honour and the Edinburgh Mathematical Society promotes an outstanding young Scottish mathematician once every four years with the Sir Edmund Whittaker Memorial Prize, also given in his honour. (Full article...)

    A 1933 portrait of Whittaker by Arthur Trevor Haddon titled Sir Edmund Taylor Whittaker

    Sir Edmund Taylor Whittaker FRS FRSE (24 October 1873 – 24 March 1956) was a British mathematician, physicist, and historian of science. Whittaker was a leading mathematical scholar of the early 20th century who contributed widely to applied mathematics and was renowned for his research in mathematical physics and numerical analysis, including the theory of special functions, along with his contributions to astronomy, celestial mechanics, the history of physics, and digital signal processing.

    Among the most influential publications in Whittaker's bibliography, he authored several popular reference works in mathematics, physics, and the history of science, including A Course of Modern Analysis (better known as Whittaker and Watson), Analytical Dynamics of Particles and Rigid Bodies, and A History of the Theories of Aether and Electricity. Whittaker is also remembered for his role in the relativity priority dispute, as he credited Henri Poincaré and Hendrik Lorentz with developing special relativity in the second volume of his History, a dispute which has lasted several decades, though scientific consensus has remained with Einstein. Whittaker served as the Royal Astronomer of Ireland early in his career, a position he held from 1906 through 1912, before moving on to the chair of mathematics at the University of Edinburgh for the next three decades and, towards the end of his career, received the Copley Medal and was knighted. The School of Mathematics of the University of Edinburgh holds The Whittaker Colloquium, a yearly lecture, in his honour and the Edinburgh Mathematical Society promotes an outstanding young Scottish mathematician once every four years with the Sir Edmund Whittaker Memorial Prize, also given in his honour. (Full article...)
  • Image 10 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 '"`UNIQ--postMath-00000004-QINU`"' points in time '"`UNIQ--postMath-00000005-QINU`"'. (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 points in time . (Full article...)
  • Image 11 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 12 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. The number and its pictograph give its name to the sexual position of the same name. The association of the number with this sex position has resulted in it being associated in meme culture with sex. People knowledgeable of the meme may respond "nice" in response to the appearance of the number, whether intentionally an innuendo or not. (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.

    The number and its pictograph give its name to the sexual position of the same name. The association of the number with this sex position has resulted in it being associated in meme culture with sex. People knowledgeable of the meme may respond "nice" in response to the appearance of the number, whether intentionally an innuendo or not. (Full article...)
More good articles

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

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


A homotopy from a circle around a sphere down to a single point.
Image credit: Richard Morris

The homotopy groups of spheres describe the different ways spheres of various dimensions can be wrapped around each other. They are studied as part of algebraic topology. The topic can be hard to understand because the most interesting and surprising results involve spheres in higher dimensions. These are defined as follows: an n-dimensional sphere, n-sphere, consists of all the points in a space of n+1 dimensions that are a fixed distance from a center point. This definition is a generalization of the familiar circle (1-sphere) and sphere (2-sphere).

The goal of algebraic topology is to categorize or classify topological spaces. Homotopy groups were invented in the late 19th century as a tool for such classification, in effect using the set of mappings from a c-sphere into a space as a way to probe the structure of that space. An obvious question was how this new tool would work on n-spheres themselves. No general solution to this question has been found to date, but many homotopy groups of spheres have been computed and the results are surprisingly rich and complicated. The study of the homotopy groups of spheres has led to the development of many powerful tools used in algebraic topology. (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
FL-Class Polyhedra articles
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 
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=1246080347"