Portal:Mathematics

The Mathematics Portal

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

Refresh with new selections below (purge)

Featured articles – load new batch

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

Image 1
The weighing pans of this balance scale contain zero objects, divided into two equal groups.

In mathematics, zero is an even number. In other words, its parity—the quality of an integer being even or odd—is even. This can be easily verified based on the definition of "even": zero is an integer multiple of 2, specifically 0 × 2. As a result, zero shares all the properties that characterize even numbers: for example, 0 is neighbored on both sides by odd numbers, any decimal integer has the same parity as its last digit—so, since 10 is even, 0 will be even, and if $y$ is even then $y + x$ has the same parity as $x$ —indeed, $0 + x$ and $x$ always have the same parity.

Zero also fits into the patterns formed by other even numbers. The parity rules of arithmetic, such as even − even = even, require 0 to be even. Zero is the additive identity element of the group of even integers, and it is the starting case from which other even natural numbers are recursively defined. Applications of this recursion from graph theory to computational geometry rely on zero being even. Not only is 0 divisible by 2, it is divisible by every power of 2, which is relevant to the binary numeral system used by computers. In this sense, 0 is the "most even" number of all. (Full article...)
Image 2

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

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

In 1594, Hues published his discoveries in the Latin work Tractatus de globis et eorum usu (Treatise on Globes and Their Use) which was written to explain the use of the terrestrial and celestial globes that had been made and published by Emery Molyneux in late 1592 or early 1593, and to encourage English sailors to use practical astronomical navigation. Hues' work subsequently went into at least 12 other printings in Dutch, English, French and Latin. (Full article...)
Image 3
General relativity, also known as the general theory of relativity, and as Einstein's theory of gravity, is the geometric theory of gravitation published by Albert Einstein in 1915 and is the current description of gravitation in modern physics. General relativity generalizes special relativity and refines Newton's law of universal gravitation, providing a unified description of gravity as a geometric property of space and time, or four-dimensional spacetime. In particular, the curvature of spacetime is directly related to the energy and momentum of whatever is
present, including matter and radiation. The relation is specified by the Einstein field equations, a system of second-order partial differential equations.

Newton's law of universal gravitation, which describes classical gravity, can be seen as a prediction of general relativity for the almost flat spacetime geometry around stationary mass distributions. Some predictions of general relativity, however, are beyond Newton's law of universal gravitation in classical physics. These predictions concern the passage of time, the geometry of space, the motion of bodies in free fall, and the propagation of light, and include gravitational time dilation, gravitational lensing, the gravitational redshift of light, the Shapiro time delay and singularities/black holes. So far, all tests of general relativity have been shown to be in agreement with the theory. The time-dependent solutions of general relativity enable us to talk about the history of the universe and have provided the modern framework for cosmology, thus leading to the discovery of the Big Bang and cosmic microwave background radiation. Despite the introduction of a number of alternative theories, general relativity continues to be the simplest theory consistent with experimental data. (Full article...)
Image 4
The manipulations of the Rubik's Cube form the Rubik's Cube group.

In mathematics, a group is a set with a binary operation that satisfies the following constraints: the operation is associative, it has an identity element, and every element of the set has an inverse element.

Many mathematical structures are groups endowed with other properties. For example, the integers with the addition operation form an infinite group, which is generated by a single element called ⁠ $1$ ⁠ (these properties characterize the integers in a unique way). (Full article...)
$Image 5 Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300). In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC). It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations. The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, 21 = 5 × 105 + (−2) × 252). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)$

Image 5
Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300).

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers, the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC).
It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules,
and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, $21$ is the GCD of $252$ and $105$ (as $252 = 21 \times 12$ and $105 = 21 \times 5)$ , and the same number $21$ is also the GCD of $105$ and $252 - 105 = 147$ . Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, that number is the GCD of the original two numbers. By reversing the steps or using the extended Euclidean algorithm, the GCD can be expressed as a linear combination of the two original numbers, that is the sum of the two numbers, each multiplied by an integer (for example, $21 = 5 \times 105 + (-2) \times 252$ ). The fact that the GCD can always be expressed in this way is known as Bézout's identity. (Full article...)
Image 6
In classical mechanics, the Laplace–Runge–Lenz vector (LRL vector) is a vector used chiefly to describe the shape and orientation of the orbit of one astronomical body around another, such as a binary star or a planet revolving around a star. For two bodies interacting by Newtonian gravity, the LRL vector is a constant of motion, meaning that it is the same no matter where it is calculated on the orbit; equivalently, the LRL vector is said to be conserved. More generally, the LRL vector is conserved in all problems in which two bodies interact by a central force that varies as the inverse square of the distance between them; such problems are called Kepler problems.

Thus hydrogen atom is a Kepler problem, since it comprises two charged particles interacting by Coulomb's law of electrostatics, another inverse-square central force. The LRL vector was essential in the first quantum mechanical derivation of the spectrum of the hydrogen atom, before the development of the Schrödinger equation. However, this approach is rarely used today. (Full article...)
Image 7

Portrait by Jakob Emanuel Handmann, 1753

Leonhard Euler (/ˈɔɪlər/ OY-lər; German: [ˈleːɔnhaʁt ˈɔʏlɐ] , Swiss Standard German: [ˈleːɔnhard ˈɔʏlər]; 15 April 1707 – 18 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, and engineer. He founded the studies of graph theory and topology and made influential discoveries in many other branches of mathematics, such as analytic number theory, complex analysis, and infinitesimal calculus. He also introduced much of modern mathematical terminology and notation, including the notion of a mathematical function. He is known for his work in mechanics, fluid dynamics, optics, astronomy, and music theory. Euler has been called a "universal genius" who "was fully equipped with almost unlimited powers of imagination, intellectual gifts and extraordinary memory". He spent most of his adult life in Saint Petersburg, Russia, and in Berlin, then the capital of Prussia.

Euler is credited for popularizing the Greek letter π {\displaystyle \pi } (lowercase pi) to denote the ratio of a circle's circumference to its diameter, as well as first using the notation f ( x ) {\displaystyle f(x)} for the value of a function, the letter i {\displaystyle i} to express the imaginary unit − 1 {\displaystyle {\sqrt {-1}}} , the Greek letter Σ {\displaystyle \Sigma } (capital sigma) to express summations, the Greek letter Δ {\displaystyle \Delta } (capital delta) for finite differences, and lowercase letters to represent the sides of a triangle while representing the angles as capital letters. He gave the current definition of the constant e {\displaystyle e} , the base of the natural logarithm, now known as Euler's number. Euler made contributions to applied mathematics and engineering, such as his study of ships which helped navigation, his three volumes on optics contributed to the design of microscopes and telescopes, and he studied the bending of beams and the critical load of columns. (Full article...)
Image 8
Logic studies valid forms of inference like modus ponens.

Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the study of deductively valid inferences or logical truths. It examines how conclusions follow from premises based on the structure of arguments alone, independent of their topic and content. Informal logic is associated with informal fallacies, critical thinking, and argumentation theory. Informal logic examines arguments expressed in natural language whereas formal logic uses formal language. When used as a countable noun, the term "a logic" refers to a specific logical formal system that articulates a proof system. Logic plays a central role in many fields, such as philosophy, mathematics, computer science, and linguistics.

Logic studies arguments, which consist of a set of premises that leads to a conclusion. An example is the argument from the premises "it's Sunday" and "if it's Sunday then I don't have to work" leading to the conclusion "I don't have to work." Premises and conclusions express propositions or claims that can be true or false. An important feature of propositions is their internal structure. For example, complex propositions are made up of simpler propositions linked by logical vocabulary like $\land$ (and) or $\to$ (if...then). Simple propositions also have parts, like "Sunday" or "work" in the example. The truth of a proposition usually depends on the meanings of all of its parts. However, this is not the case for logically true propositions. They are true only because of their logical structure independent of the specific meanings of the individual parts. (Full article...)
Image 9
In algebraic geometry and theoretical physics, mirror symmetry is a relationship between geometric objects called Calabi–Yau manifolds. The term refers to a situation where two Calabi–Yau manifolds look very different geometrically but are nevertheless equivalent when employed as extra dimensions of string theory.

Early cases of mirror symmetry were discovered by physicists. Mathematicians became interested in this relationship around 1990 when Philip Candelas, Xenia de la Ossa, Paul Green, and Linda Parkes showed that it could be used as a tool in enumerative geometry, a branch of mathematics concerned with counting the number of solutions to geometric questions. Candelas and his collaborators showed that mirror symmetry could be used to count rational curves on a Calabi–Yau manifold, thus solving a longstanding problem. Although the original approach to mirror symmetry was based on physical ideas that were not understood in a mathematically precise way, some of its mathematical predictions have since been proven rigorously. (Full article...)
Image 10
The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group $S̃ 3$

The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects. In addition to this geometric description, the affine symmetric groups may be defined in other ways: as collections of permutations (rearrangements) of the integers ( $..., -2, -1, 0, 1, 2, ...$ ) that are periodic in a certain sense, or in purely algebraic terms as a group with certain generators and relations. They are studied in combinatorics and representation theory.

A finite symmetric group consists of all permutations of a finite set. Each affine symmetric group is an infinite extension of a finite symmetric group. Many important combinatorial properties of the finite symmetric groups can be extended to the corresponding affine symmetric groups. Permutation statistics such as descents and inversions can be defined in the affine case. As in the finite case, the natural combinatorial definitions for these statistics also have a geometric interpretation. (Full article...)
Image 11

Noether c. 1900–1910

Amalie Emmy Noether (US: /ˈnʌtər/, UK: /ˈnɜːtə/; German: [ˈnøːtɐ]; 23 March 1882 – 14 April 1935) was a German mathematician who made many important contributions to abstract algebra. She also proved Noether's first and second theorems, which are fundamental in mathematical physics. Noether was described by Pavel Alexandrov, Albert Einstein, Jean Dieudonné, Hermann Weyl and Norbert Wiener as the most important woman in the history of mathematics. As one of the leading mathematicians of her time, she developed theories of rings, fields, and algebras. In physics, Noether's theorem explains the connection between symmetry and conservation laws.

Noether was born to a Jewish family in the Franconian town of Erlangen; her father was the mathematician Max Noether. She originally planned to teach French and English after passing the required examinations but instead studied mathematics at the University of Erlangen, where her father lectured. After completing her doctorate in 1907 under the supervision of Paul Gordan, she worked at the Mathematical Institute of Erlangen without pay for seven years. At the time, women were largely excluded from academic positions. In 1915, she was invited by David Hilbert and Felix Klein to join the mathematics department at the University of Göttingen, a world-renowned center of mathematical research. The philosophical faculty objected, however, and she spent four years lecturing under Hilbert's name. Her habilitation was approved in 1919, allowing her to obtain the rank of Privatdozent. (Full article...)
Image 12
Plots of logarithm functions, with three commonly used bases. The special points $log b b = 1$ are indicated by dotted lines, and all curves intersect in $log b 1 = 0$ .

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

The logarithm base $10$ is called the decimal or common logarithm and is commonly used in science and engineering. The natural logarithm has the number $e \approx 2.718$ as its base; its use is widespread in mathematics and physics because of its very simple derivative. The binary logarithm uses base $2$ and is widely used in computer science, information theory, music theory, and photography. When the base is unambiguous from the context or irrelevant it is often omitted, and the logarithm is written $log x$ . (Full article...)
Image 13
The number π (/paɪ/ ; spelled out as pi) is a mathematical constant, approximately equal to 3.14159, that is the ratio of a circle's circumference to its diameter. It appears in many formulae across mathematics and physics, and some of these formulae are commonly used for defining π, to avoid relying on the definition of the length of a curve.

The number π is an irrational number, meaning that it cannot be expressed exactly as a ratio of two integers, although fractions such as 22 7 {\displaystyle {\tfrac {22}{7}}} are commonly used to approximate it. Consequently, its decimal representation never ends, nor enters a permanently repeating pattern. It is a transcendental number, meaning that it cannot be a solution of an algebraic equation involving only finite sums, products, powers, and integers. The transcendence of π implies that it is impossible to solve the ancient challenge of squaring the circle with a compass and straightedge. The decimal digits of π appear to be randomly distributed, but no proof of this conjecture has been found. (Full article...)
Image 14

Émile Michel Hyacinthe Lemoine (French: [emil ləmwan]; 22 November 1840 – 21 February 1912) was a French civil engineer and a mathematician, a geometer in particular. He was educated at a variety of institutions, including the Prytanée National Militaire and, most notably, the École Polytechnique. Lemoine taught as a private tutor for a short period after his graduation from the latter school.

Lemoine is best known for his proof of the existence of the Lemoine point (or the symmedian point) of a triangle. Other mathematical work includes a system he called Géométrographie and a method which related algebraic expressions to geometric objects. He has been called a co-founder of modern triangle geometry, as many of its characteristics are present in his work. (Full article...)
Image 15
Figure 1: A solution (in purple) to Apollonius's problem. The given circles are shown in black.

In Euclidean plane geometry, Apollonius's problem is to construct circles that are tangent to three given circles in a plane (Figure 1). Apollonius of Perga (c. 262 BC – c. 190 BC) posed and solved this famous problem in his work Ἐπαφαί (Epaphaí, "Tangencies"); this work has been lost, but a 4th-century AD report of his results by Pappus of Alexandria has survived. Three given circles generically have eight different circles that are tangent to them (Figure 2), a pair of solutions for each way to divide the three given circles in two subsets (there are 4 ways to divide a set of cardinality 3 in 2 parts).

In the 16th century, Adriaan van Roomen solved the problem using intersecting hyperbolas, but this solution does not use only straightedge and compass constructions. François Viète found such a solution by exploiting limiting cases: any of the three given circles can be shrunk to zero radius (a point) or expanded to infinite radius (a line). Viète's approach, which uses simpler limiting cases to solve more complicated ones, is considered a plausible reconstruction of Apollonius' method. The method of van Roomen was simplified by Isaac Newton, who showed that Apollonius' problem is equivalent to finding a position from the differences of its distances to three known points. This has applications in navigation and positioning systems such as LORAN. (Full article...)

More featured articles

edit

Selected image – show another

colored ball with "hair" (representing a vector field on a sphere)

Hairy ball theorem

Credit: The Evil Midnight Uploader what Uploads at Midnight

This image illustrates a failed attempt to comb the "hair" on a ball flat, leaving a tuft sticking out at each pole. The hairy ball theorem of algebraic topology states that whenever one attempts to comb a hairy ball, there will always be at least one point on the ball at which a tuft of hair sticks out. More precisely, it states that there is no nonvanishing continuous tangent-vector field on an even-dimensional n‑sphere (an ordinary sphere in three-dimensional space is known as a "2-sphere"). This is not true of certain other three-dimensional shapes, such as a torus (doughnut shape) which can be combed flat. The theorem was first stated by Henri Poincaré in the late 19th century and proved in 1912 by L. E. J. Brouwer. If one idealizes the wind in the Earth's atmosphere as a tangent-vector field, then the hairy ball theorem implies that given any wind at all on the surface of the Earth, there must at all times be a cyclone somewhere. Note, however, that wind can move vertically in the atmosphere, so the idealized case is not meteorologically sound. (What is true is that for every "shell" of atmosphere around the Earth, there must be a point on the shell where the wind is not moving horizontally.) The theorem also has implications in computer modeling (including video game design), in which a common problem is to compute a non-zero 3-D vector that is orthogonal (i.e., perpendicular) to a given one; the hairy ball theorem implies that there is no single continuous function that accomplishes this task.

More selected pictures

Good articles – load new batch

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

Image 1
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 2
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 3
The Euclid–Euler theorem is a theorem in number theory that relates perfect numbers to Mersenne primes. It states that an even number is perfect if and only if it has the form $2 p -1 (2 p - 1)$ , where $2 p - 1$ is a prime number. The theorem is named after mathematicians Euclid and Leonhard Euler, who respectively proved the "if" and "only if" aspects of the theorem.

It has been conjectured that there are infinitely many Mersenne primes. Although the truth of this conjecture remains unknown, it is equivalent, by the Euclid–Euler theorem, to the conjecture that there are infinitely many even perfect numbers. However, it is also unknown whether there exists even a single odd perfect number. (Full article...)
Image 4
A convex curve (black) forms a connected subset of the boundary of a convex set (blue), and has a supporting line (red) through each of its points.

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

Bounded convex curves have a well-defined length, which can be obtained by approximating them with polygons, or from the average length of their projections onto a line. The maximum number of grid points that can belong to a single curve is controlled by its length. The points at which a convex curve has a unique supporting line are dense within the curve, and the distance of these lines from the origin defines a continuous support function. A smooth simple closed curve is convex if and only if its curvature has a consistent sign, which happens if and only if its total curvature equals its total absolute curvature. (Full article...)
Image 5
In number theory, specifically the study of Diophantine approximation, the lonely runner conjecture is a conjecture about the long-term behavior of runners on a circular track. It states that $n$ runners on a track of unit length, with constant speeds all distinct from one another, will each be lonely at some time—at least $1/n$ units away from all others.

The conjecture was first posed in 1967 by German mathematician Jörg M. Wills, in purely number-theoretic terms, and independently in 1974 by T. W. Cusick; its illustrative and now-popular formulation dates to 1998. The conjecture is known to be true for seven runners or fewer, but the general case remains unsolved. Implications of the conjecture include solutions to view-obstruction problems and bounds on properties, related to chromatic numbers, of certain graphs. (Full article...)
Image 6
In order theory and model theory, branches of mathematics, Cantor's isomorphism theorem states that every two countable dense unbounded linear orders are order-isomorphic. For instance, Minkowski's question-mark function produces an isomorphism (a one-to-one order-preserving correspondence) between the numerical ordering of the rational numbers and the numerical ordering of the dyadic rationals.

The theorem is named after Georg Cantor, who first published it in 1895, using it to characterize the (uncountable) ordering on the real numbers. It can be proved by a back-and-forth method that is also sometimes attributed to Cantor but was actually published later, by Felix Hausdorff. The same back-and-forth method also proves that countable dense unbounded orders are highly symmetric, and can be applied to other kinds of structures. However, Cantor's original proof only used the "going forth" half of this method. In terms of model theory, the isomorphism theorem can be expressed by saying that the first-order theory of unbounded dense linear orders is countably categorical, meaning that it has only one countable model, up to logical equivalence. (Full article...)
Image 7
A Hasse diagram of divisibility relationships among the regular numbers up to 400. The vertical scale is logarithmic.

Regular numbers are numbers that evenly divide powers of 60 (or, equivalently, powers of 30). Equivalently, they are the numbers whose only prime divisors are 2, 3, and 5. As an example, 60² = 3600 = 48 × 75, so as divisors of a power of 60 both 48 and 75 are regular.

These numbers arise in several areas of mathematics and its applications, and have different names coming from their different areas of study.
- In number theory, these numbers are called 5-smooth, because they can be characterized as having only 2, 3, or 5 as their prime factors. This is a specific case of the more general $k$ -smooth numbers, the numbers that have no prime factor greater than $k$ .* In the study of Babylonian mathematics, the divisors of powers of 60 are called regular numbers or regular sexagesimal numbers, and are of great importance in this area because of the sexagesimal (base 60) number system that the Babylonians used for writing their numbers, and that was central to Babylonian mathematics.
- In music theory, regular numbers occur in the ratios of tones in five-limit just intonation. In connection with music theory and related theories of architecture, these numbers have been called the harmonic whole numbers.
- In computer science, regular numbers are often called Hamming numbers, after Richard Hamming, who proposed the problem of finding computer algorithms for generating these numbers in ascending order. This problem has been used as a test case for functional programming.
(Full article...)
Image 8
Stars is a wood engraving print created by the Dutch artist M. C. Escher in 1948, depicting two chameleons in a polyhedral cage floating through space.

The compound of three octahedra used for the central cage in Stars had been studied before in mathematics, and Escher likely learned of it from the book Vielecke und Vielflache by Max Brückner. Escher used similar compound polyhedral forms in several other works, including Crystal (1947), Study for Stars (1948), Double Planetoid (1949), and Waterfall (1961). (Full article...)
Image 9

Portrait by Christian Albrecht Jensen, 1840 (copy from Gottlieb Biermann, 1887)

Johann Carl Friedrich Gauss (/ɡaʊs/ ; German: Gauß [kaʁl ˈfʁiːdʁɪç ˈɡaʊs] ; Latin: Carolus Fridericus Gauss; 30 April 1777 – 23 February 1855) was a German mathematician, astronomer, geodesist, and physicist, who contributed to many fields in mathematics and science, and has been called "the prince of mathematics" and "the greatest mathematician who ever lived". He was director of the Göttingen Observatory and professor of astronomy from 1807 until his death in 1855.

While studying at the University of Göttingen, he propounded several mathematical theorems. As an independent scholar, he wrote the masterpieces Disquisitiones Arithmeticae and Theoria motus corporum coelestium. Gauss produced the second and third complete proofs of the fundamental theorem of algebra. In number theory, he made numerous contributions, such as the composition law, the law of quadratic reciprocity and the Fermat polygonal number theorem. He also contributed to the theory of binary and ternary quadratic forms, the construction of the heptadecagon, and the theory of hypergeometric series. Due to Gauss' extensive and fundamental contributions to science and mathematics, more than 100 mathematical and scientific concepts are named after him. (Full article...)
Image 10

In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares on the other two sides.

The theorem can be written as an equation relating the lengths of the sides $a$ , $b$ and the hypotenuse $c$ , sometimes called the Pythagorean equation:
: $a^{2}+b^{2}=c^{2}.$
The theorem is named for the Greek philosopher Pythagoras, born around 570 BC. The theorem has been proved numerous times by many different methods – possibly the most for any mathematical theorem. The proofs are diverse, including both geometric proofs and algebraic proofs, with some dating back thousands of years. (Full article...)
Image 11
The Alexandrov uniqueness theorem is a rigidity theorem in mathematics, describing three-dimensional convex polyhedra in terms of the distances between points on their surfaces. It implies that convex polyhedra with distinct shapes from each other also have distinct metric spaces of surface distances, and it characterizes the metric spaces that come from the surface distances on polyhedra. It is named after Soviet mathematician Aleksandr Danilovich Aleksandrov, who published it in the 1940s. (Full article...)
Image 12
A spiral staircase in the Cathedral of St. John the Divine. Several helical curves in the staircase project to hyperbolic spirals in its photograph.

A hyperbolic spiral is a type of spiral with a pitch angle that increases with distance from its center, unlike the constant angles of logarithmic spirals or decreasing angles of Archimedean spirals. As this curve widens, it approaches an asymptotic line. It can be found in the view up a spiral staircase and the starting arrangement of certain footraces, and is used to model spiral galaxies and architectural volutes.

As a plane curve, a hyperbolic spiral can be described in polar coordinates $(r,\varphi )$ by the equation
$r={\frac {a}{\varphi }},$
for an arbitrary choice of the scale factor $a.$ (Full article...)

More good articles

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

... that Hong Wang's latest paper claims to have resolved the Kakeya conjecture, described as "one of the most sought-after open problems in geometric measure theory", in three dimensions?
... that ten-sided gaming dice have kite-shaped faces?
... that two members of the French parliament were killed when a delayed-action German bomb exploded in the town hall at Bapaume on 25 March 1917?
... that the word algebra is derived from an Arabic term for the surgical treatment of bonesetting?
... that the British National Hospital Service Reserve trained volunteers to carry out first aid in the aftermath of a nuclear or chemical attack?
... that Kit Nascimento, a spokesperson for the government of Guyana during the aftermath of Jonestown, disagrees with current proposals to open the former Jonestown site as a tourist attraction?
... that after Archimedes first defined convex curves, mathematicians lost interest in their analysis until the 19th century, more than two millennia later?
... that Catechumen, a Christian first-person shooter, was funded only in the aftermath of the Columbine High School massacre?

edit

More did you know – view different entries

Did you know...

...that the axiom of choice is logically independent of the other axioms of Zermelo–Fraenkel set theory?
...that the Pythagorean Theorem generalizes to any three similar shapes on the three sides of a right-angled triangle?
...that the orthocenter, circumcenter, centroid and the centre of the nine-point circle all lie on one line, the Euler line?
...that an arbitrary quadrilateral will tessellate?
...that it has not been proven whether or not every even integer greater than two can be expressed as the sum of two primes?
...that the sum of the first n odd numbers divided by the sum of the next n odd numbers is always equal to one third?
...that i to the power of i, where i is the square root of -1, is a real number?

More did you know facts

Showing 7 items out of 75

edit

Selected article – show another

Mathematics department in Göttingen where Hilbert worked from 1895 until his retirement in 1930
Image credit: Daniel Schwen

David Hilbert (January 23, 1862, Wehlau, Prussia–February 14, 1943, Göttingen, Germany) was a German mathematician, recognized as one of the most influential mathematicians of the 19th and early 20th centuries. He established his reputation as a great mathematician and scientist by inventing or developing a broad range of ideas, such as invariant theory, the axiomization of geometry, and the notion of Hilbert space, one of the foundations of functional analysis. Hilbert and his students supplied significant portions of the mathematic infrastructure required for quantum mechanics and general relativity. He is one of the founders of proof theory, mathematical logic, and the distinction between mathematics and metamathematics, and warmly defended Cantor's set theory and transfinite numbers. A famous example of his world leadership in mathematics is his 1900 presentation of a set of problems that set the course for much of the mathematical research of the 20th century. (Full article...)

View all selected articles

edit

Subcategories

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

More mathematics categories

edit

Topics in mathematics

General

Foundations

Number theory

Discrete mathematics

Algebra

Analysis

Geometry and topology

Applied mathematics

edit

Index of mathematics articles

ARTICLE INDEX:	0–9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
MATHEMATICIANS:	A B C D E F G H I J K L M N O P Q R S T U V W X Y Z