Wikipedia

Portal:Mathematics

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

animation of a grid of boxes numbered 2 through 120, where the prime numbers are progressively circled and listed to the side while the composite numbers are struck out
animation of a grid of boxes numbered 2 through 120, where the prime numbers are progressively circled and listed to the side while the composite numbers are struck out
The sieve of Eratosthenes is a simple algorithm for finding all prime numbers up to a specified maximum value. It works by identifying the prime numbers in increasing order while removing from consideration composite numbers that are multiples of each prime. This animation shows the process of finding all primes no greater than 120. The algorithm begins by identifying 2 as the first prime number and then crossing out every multiple of 2 up to 120. The next available number, 3, is the next prime number, so then every multiple of 3 is crossed out. (In this version of the algorithm, 6 is not crossed out again since it was just identified as a multiple of 2. The same optimization is used for all subsequent steps of the process: given a prime p, only multiples no less than p2 are considered for crossing out, since any lower multiples must already have been identified as multiples of smaller primes. Larger multiples that just happen to already be crossed out—like 12 when considering multiples of 3—are crossed out again, because checking for such duplicates would impose an unnecessary speed penalty on any real-world implementation of the algorithm.) The next remaining number, 5, is the next prime, so its multiples get crossed out (starting with 25); and so on. The process continues until no more composite numbers could possibly be left in the list (i.e., when the square of the next prime exceeds the specified maximum). The remaining numbers (here starting with 11) are all prime. Note that this procedure is easily extended to find primes in any given arithmetic progression. One of several prime number sieves, this ancient algorithm was attributed to the Greek mathematician Eratosthenes (d. c. 194 BCE) by Nicomachus in his first-century (CE) work Introduction to Arithmetic. Other more modern sieves include the sieve of Sundaram (1934) and the sieve of Atkin (2003). The main benefit of sieve methods is the avoidance of costly primality tests (or, conversely, divisibility tests). Their main drawback is their restriction to specific ranges of numbers, which makes this type of method inappropriate for applications requiring very large prime numbers, such as public-key cryptography.

Good articles – load new batch

  These are Good articles, which meet a core set of high editorial standards.
  • Image 1 The mutilated chessboard The mutilated chessboard problem is a tiling puzzle posed by Max Black in 1946 that asks: Suppose a standard 8×8 chessboard (or checkerboard) has two diagonally opposite corners removed, leaving 62 squares. Is it possible to place 31 dominoes of size 2×1 so as to cover all of these squares? (Full article...)
    The mutilated chessboard

    The mutilated chessboard problem is a tiling puzzle posed by Max Black in 1946 that asks:

    Suppose a standard 8×8 chessboard (or checkerboard) has two diagonally opposite corners removed, leaving 62 squares. Is it possible to place 31 dominoes of size 2×1 so as to cover all of these squares?

    (Full article...)
  • Image 2 Einstein in 1921 Albert Einstein (/ˈaɪnstaɪn/ EYEN-styne; German: [ˈalbɛɐt ˈʔaɪnʃtaɪn] ⓘ; 14 March 1879 – 18 April 1955) was a German-born theoretical physicist who is widely held to be one of the greatest and most influential scientists of all time. Best known for developing the theory of relativity, Einstein also made important contributions to quantum mechanics, and was thus a central figure in the revolutionary reshaping of the scientific understanding of nature that modern physics accomplished in the first decades of the twentieth century. His mass–energy equivalence formula E = mc2, which arises from relativity theory, has been called "the world's most famous equation". He received the 1921 Nobel Prize in Physics "for his services to theoretical physics, and especially for his discovery of the law of the photoelectric effect", a pivotal step in the development of quantum theory. His work is also known for its influence on the philosophy of science. Born in the German Empire, Einstein moved to Switzerland in 1895, forsaking his German citizenship (as a subject of the Kingdom of Württemberg) the following year. In 1897, at the age of seventeen, he enrolled in the mathematics and physics teaching diploma program at the Swiss federal polytechnic school in Zürich, graduating in 1900. In 1901, he acquired Swiss citizenship, which he kept for the rest of his life. In 1903, he secured a permanent position at the Swiss Patent Office in Bern. In 1905, he submitted a successful PhD dissertation to the University of Zurich. In 1914, he moved to Berlin in order to join the Prussian Academy of Sciences and the Humboldt University of Berlin. In 1917, he became director of the Kaiser Wilhelm Institute for Physics; he also became a German citizen again, this time as a subject of the Kingdom of Prussia. (Full article...)

    Einstein in 1921

    Albert Einstein (/ˈaɪnstaɪn/ EYEN-styne; German: [ˈalbɛɐt ˈʔaɪnʃtaɪn] ⓘ; 14 March 1879 – 18 April 1955) was a German-born theoretical physicist who is widely held to be one of the greatest and most influential scientists of all time. Best known for developing the theory of relativity, Einstein also made important contributions to quantum mechanics, and was thus a central figure in the revolutionary reshaping of the scientific understanding of nature that modern physics accomplished in the first decades of the twentieth century. His mass–energy equivalence formula E = mc2, which arises from relativity theory, has been called "the world's most famous equation". He received the 1921 Nobel Prize in Physics "for his services to theoretical physics, and especially for his discovery of the law of the photoelectric effect", a pivotal step in the development of quantum theory. His work is also known for its influence on the philosophy of science.

    Born in the German Empire, Einstein moved to Switzerland in 1895, forsaking his German citizenship (as a subject of the Kingdom of Württemberg) the following year. In 1897, at the age of seventeen, he enrolled in the mathematics and physics teaching diploma program at the Swiss federal polytechnic school in Zürich, graduating in 1900. In 1901, he acquired Swiss citizenship, which he kept for the rest of his life. In 1903, he secured a permanent position at the Swiss Patent Office in Bern. In 1905, he submitted a successful PhD dissertation to the University of Zurich. In 1914, he moved to Berlin in order to join the Prussian Academy of Sciences and the Humboldt University of Berlin. In 1917, he became director of the Kaiser Wilhelm Institute for Physics; he also became a German citizen again, this time as a subject of the Kingdom of Prussia. (Full article...)
  • Image 3 Malfatti circles In geometry, the Malfatti circles are three circles inside a given triangle such that each circle is tangent to the other two and to two sides of the triangle. They are named after Gian Francesco Malfatti, who made early studies of the problem of constructing these circles in the mistaken belief that they would have the largest possible total area of any three disjoint circles within the triangle. Malfatti's problem has been used to refer both to the problem of constructing the Malfatti circles and to the problem of finding three area-maximizing circles within a triangle. A simple construction of the Malfatti circles was given by Steiner (1826) harvtxt error: no target: CITEREFSteiner1826 (help), and many mathematicians have since studied the problem. Malfatti himself supplied a formula for the radii of the three circles, and they may also be used to define two triangle centers, the Ajima–Malfatti points of a triangle. (Full article...)
    Malfatti circles

    In geometry, the Malfatti circles are three circles inside a given triangle such that each circle is tangent to the other two and to two sides of the triangle. They are named after Gian Francesco Malfatti, who made early studies of the problem of constructing these circles in the mistaken belief that they would have the largest possible total area of any three disjoint circles within the triangle.

    Malfatti's problem has been used to refer both to the problem of constructing the Malfatti circles and to the problem of finding three area-maximizing circles within a triangle.
    A simple construction of the Malfatti circles was given by Steiner (1826), and many mathematicians have since studied the problem. Malfatti himself supplied a formula for the radii of the three circles, and they may also be used to define two triangle centers, the Ajima–Malfatti points of a triangle. (Full article...)
  • Image 4 Roman copy (in marble) of a Greek bronze bust of Aristotle by Lysippos (c. 330 BC), with modern alabaster mantle Aristotle (Greek: Ἀριστοτέλης Aristotélēs; 384–322 BC) was an Ancient Greek philosopher and polymath. His writings cover a broad range of subjects spanning the natural sciences, philosophy, linguistics, economics, politics, psychology, and the arts. As the founder of the Peripatetic school of philosophy in the Lyceum in Athens, he began the wider Aristotelian tradition that followed, which set the groundwork for the development of modern science. Little is known about Aristotle's life. He was born in the city of Stagira in northern Greece during the Classical period. His father, Nicomachus, died when Aristotle was a child, and he was brought up by a guardian. At 17 or 18, he joined Plato's Academy in Athens and remained there until the age of 37 (c. 347 BC). Shortly after Plato died, Aristotle left Athens and, at the request of Philip II of Macedon, tutored his son Alexander the Great beginning in 343 BC. He established a library in the Lyceum, which helped him to produce many of his hundreds of books on papyrus scrolls. (Full article...)

    Roman copy (in marble) of a Greek bronze bust of Aristotle by Lysippos (c. 330 BC), with modern alabaster mantle

    Aristotle (Greek: Ἀριστοτέλης Aristotélēs; 384–322 BC) was an Ancient Greek philosopher and polymath. His writings cover a broad range of subjects spanning the natural sciences, philosophy, linguistics, economics, politics, psychology, and the arts. As the founder of the Peripatetic school of philosophy in the Lyceum in Athens, he began the wider Aristotelian tradition that followed, which set the groundwork for the development of modern science.

    Little is known about Aristotle's life. He was born in the city of Stagira in northern Greece during the Classical period. His father, Nicomachus, died when Aristotle was a child, and he was brought up by a guardian. At 17 or 18, he joined Plato's Academy in Athens and remained there until the age of 37 (c. 347 BC). Shortly after Plato died, Aristotle left Athens and, at the request of Philip II of Macedon, tutored his son Alexander the Great beginning in 343 BC. He established a library in the Lyceum, which helped him to produce many of his hundreds of books on papyrus scrolls. (Full article...)
  • Image 5 In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Perhaps most familiar as a property of arithmetic, e.g. "3 + 4 = 4 + 3" or "2 × 5 = 5 × 2", the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, "3 − 5 ≠ 5 − 3"); such operations are not commutative, and so are referred to as noncommutative operations. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said to be symmetric if the relation applies regardless of the order of its operands; for example, equality is symmetric as two equal mathematical objects are equal regardless of their order. (Full article...)

    In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Perhaps most familiar as a property of arithmetic, e.g. "3 + 4 = 4 + 3" or "2 × 5 = 5 × 2", the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, "3 − 5 ≠ 5 − 3"); such operations are not commutative, and so are referred to as noncommutative operations. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said to be symmetric if the relation applies regardless of the order of its operands; for example, equality is symmetric as two equal mathematical objects are equal regardless of their order. (Full article...)
  • Image 6 A unit cube with a hole cut through it, large enough to allow Prince Rupert's cube to pass In geometry, Prince Rupert's cube is the largest cube that can pass through a hole cut through a unit cube without splitting it into separate pieces. Its side length is approximately 1.06, 6% larger than the side length 1 of the unit cube through which it passes. The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution. Prince Rupert's cube is named after Prince Rupert of the Rhine, who asked whether a cube could be passed through a hole made in another cube of the same size without splitting the cube into two pieces. A positive answer was given by John Wallis. Approximately 100 years later, Pieter Nieuwland found the largest possible cube that can pass through a hole in a unit cube. (Full article...)
    A unit cube with a hole cut through it, large enough to allow Prince Rupert's cube to pass

    In geometry, Prince Rupert's cube is the largest cube that can pass through a hole cut through a unit cube without splitting it into separate pieces. Its side length is approximately 1.06, 6% larger than the side length 1 of the unit cube through which it passes. The problem of finding the largest square that lies entirely within a unit cube is closely related, and has the same solution.

    Prince Rupert's cube is named after Prince Rupert of the Rhine, who asked whether a cube could be passed through a hole made in another cube of the same size without splitting the cube into two pieces. A positive answer was given by John Wallis. Approximately 100 years later, Pieter Nieuwland found the largest possible cube that can pass through a hole in a unit cube. (Full article...)
  • Image 7 Graphical demonstration of the convergence of the sum 1/2 + 1/3 + 1/7 + 1/43 + ... to 1. 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. Squares with side lengths 1/1807 or smaller are too small to see in the figure and are not shown. In number theory, Sylvester's sequence is an integer sequence in which each term is the product of the previous terms, plus one. Its first few terms are :2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in the OEIS). Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its terms. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.[1] (Full article...)
    Graphical demonstration of the convergence of the sum 1/2 + 1/3 + 1/7 + 1/43 + ... to 1. 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. Squares with side lengths 1/1807 or smaller are too small to see in the figure and are not shown.

    In number theory, Sylvester's sequence is an integer sequence in which each term is the product of the previous terms, plus one. Its first few terms are
    :2, 3, 7, 43, 1807, 3263443, 10650056950807, 113423713055421844361000443 (sequence A000058 in the OEIS).

    Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880. Its values grow doubly exponentially, and the sum of its reciprocals forms a series of unit fractions that converges to 1 more rapidly than any other series of unit fractions. The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude, but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its terms. Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds, and hard instances for online algorithms.[1] (Full article...)
  • Image 8 The Laves graph In geometry and crystallography, the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three equal-length segments meet at 120° angles at each point, and all cycles use ten or more segments. It is the shortest possible triply periodic graph, relative to the volume of its fundamental domain. One arrangement of the Laves graph uses one out of every eight of the points in the integer lattice as its points, and connects all pairs of these points that are nearest neighbors, at distance '"`UNIQ--postMath-00000008-QINU`"'. It can also be defined, divorced from its geometry, as an abstract undirected graph, a covering graph of the complete graph on four vertices. H. S. M. Coxeter (1955) named this graph after Fritz Laves, who first wrote about it as a crystal structure in 1932. It has also been called the K4 crystal, (10,3)-a network, diamond twin, triamond, and the srs net. The regions of space nearest each vertex of the graph are congruent 17-sided polyhedra that tile space. Its edges lie on diagonals of the regular skew polyhedron, a surface with six squares meeting at each integer point of space. (Full article...)
    The Laves graph

    In geometry and crystallography, the Laves graph is an infinite and highly symmetric system of points and line segments in three-dimensional Euclidean space, forming a periodic graph. Three equal-length segments meet at 120° angles at each point, and all cycles use ten or more segments. It is the shortest possible triply periodic graph, relative to the volume of its fundamental domain. One arrangement of the Laves graph uses one out of every eight of the points in the integer lattice as its points, and connects all pairs of these points that are nearest neighbors, at distance . It can also be defined, divorced from its geometry, as an abstract undirected graph, a covering graph of the complete graph on four vertices.
    H. S. M. Coxeter (1955) named this graph after Fritz Laves, who first wrote about it as a crystal structure in 1932. It has also been called the K4 crystal, (10,3)-a network, diamond twin, triamond, and the srs net. The regions of space nearest each vertex of the graph are congruent 17-sided polyhedra that tile space. Its edges lie on diagonals of the regular skew polyhedron, a surface with six squares meeting at each integer point of space. (Full article...)
  • Image 9 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 10 An m × n matrix: the m rows are horizontal and the n columns are vertical. Each element of a matrix is often denoted by a variable with two subscripts. For example, a2,1 represents the element at the second row and first column of the matrix. In mathematics, a matrix (pl.: matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or property of such an object. For example, '"`UNIQ--postMath-00000009-QINU`"' is a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a "'"`UNIQ--postMath-0000000A-QINU`"' matrix", or a matrix of dimension '"`UNIQ--postMath-0000000B-QINU`"'. (Full article...)
    Two tall square brackets with m-many rows each containing n-many subscripted letter 'a' variables. Each letter 'a' is given a row number and column number as its subscript.
    An m × n matrix: the m rows are horizontal and the n columns are vertical. Each element of a matrix is often denoted by a variable with two subscripts. For example, a2,1 represents the element at the second row and first column of the matrix.


    In mathematics, a matrix (pl.: matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or property of such an object.

    For example,

    is a matrix with two rows and three columns. This is often referred to as a "two-by-three matrix", a " matrix", or a matrix of dimension . (Full article...)
  • Image 11 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 '"`UNIQ--postMath-0000000C-QINU`"' given planar points may be found in time '"`UNIQ--postMath-0000000D-QINU`"', 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...)
    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 given planar points may be found in time , 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...)
  • Image 12 Elementary algebra is interested in polynomial equations and seeks to discover which values solve them. Algebra is the branch of mathematics that studies algebraic structures and the manipulation of statements within those structures. It is a generalization of arithmetic that introduces variables and algebraic operations other than the standard arithmetic operations such as addition and multiplication. Elementary algebra is the main form of algebra taught in school and examines mathematical statements using variables for unspecified values. It seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field investigating variables that appear in several linear equations, so-called systems of linear equations. It tries to discover the values that solve all equations at the same time. (Full article...)

    Elementary algebra is interested in polynomial equations and seeks to discover which values solve them.

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

    Elementary algebra is the main form of algebra taught in school and examines mathematical statements using variables for unspecified values. It seeks to determine for which values the statements are true. To do so, it uses different methods of transforming equations to isolate variables. Linear algebra is a closely related field investigating variables that appear in several linear equations, so-called systems of linear equations. It tries to discover the values that solve all equations at the same time. (Full article...)
More good articles

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

  • ... that in 1940 Xu Ruiyun became the first Chinese woman to receive a PhD in mathematics?
  • ... that circle packings in the form of a Doyle spiral were used to model plant growth long before their mathematical investigation by Doyle?
  • ... that the mathematical infinity symbol ∞ may be derived from the Roman numerals for 1000 or for 100 million?
  • ... that The Math Myth advocates for American high schools to stop requiring advanced algebra?
  • ... that Donn Piatt threw his mathematics teacher out of the window?
  • ... that Catechumen, a Christian first-person shooter, was funded only in the aftermath of the Columbine High School massacre?
  • ... that Arithmetic was the first mathematics text book written in the Russian language?
  • ... that ten-sided gaming dice have kite-shaped faces?
edit 

More did you know – view different entries

Did you know...
Did you know...
  • ...the Piphilology record (memorizing digits of Pi) is 70000 as of Mar 2015?
  • ...that people are significantly slower to identify the parity of zero than other whole numbers, regardless of age, language spoken, or whether the symbol or word for zero is used?
  • ...that Auction theory was successfully used in 1994 to sell FCC airwave spectrum, in a financial application of game theory?
  • ...properties of Pascal's triangle have application in many fields of mathematics including combinatorics, algebra, calculus and geometry?
  • ...work in artificial intelligence makes use of swarm intelligence, which has foundations in the behavioral examples found in nature of ants, birds, bees, and fish among others?
  • ...that statistical properties dictated by Benford's Law are used in auditing of financial accounts as one means of detecting fraud?
  • ...that modular arithmetic has application in at least ten different fields of study, including the arts, computer science, and chemistry in addition to mathematics?
More did you know facts
Showing 7 items out of 75
edit 

Selected article – show another


Dodecahedron
Image credit:

A Platonic solid is a convex regular polyhedron. These are the three-dimensional analogs of the convex regular polygons. There are precisely five such figures (shown on the left). The name of each figure is derived from the number of its faces: respectively 4, 6, 8, 12 and 20. They are unique in that the sides, edges and angles are all congruent.
Due to their aesthetic beauty and symmetry, the Platonic solids have been a favorite subject of geometers for thousands of years. They are named after the ancient Greek philosopher Plato who claimed the classical elements were constructed from the regular solids.
The Platonic solids have been known since antiquity. The five solids were certainly known to the ancient Greeks and there is evidence that these figures were known long before then. The neolithic people of Scotland constructed stone models of all five solids at least 1000 years before Plato. (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 
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

  1. ^ Galambos & Woeginger (1995); Brown (1979); Liang (1980).
Retrieved from "https://en.wikipedia.org/w/index.php?title=Portal:Mathematics&oldid=1158081156"