Portal:Mathematics

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

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

É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 2
High-precision test of general relativity by the Cassini space probe (artist's impression): radio signals sent between the Earth and the probe (green wave) are delayed by the warping of spacetime (blue lines) due to the Sun's mass.

General relativity is a theory of gravitation developed by Albert Einstein between 1907 and 1915. The theory of general relativity says that the observed gravitational effect between masses results from their warping of spacetime.

By the beginning of the 20th century, Newton's law of universal gravitation had been accepted for more than two hundred years as a valid description of the gravitational force between masses. In Newton's model, gravity is the result of an attractive force between massive objects. Although even Newton was troubled by the unknown nature of that force, the basic framework was extremely successful at describing motion. (Full article...)
Image 3
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 to base $b$ is the inverse function of exponentiation with base $b$ . That means that the logarithm of a number $x$ to the base $b$ is the exponent to which $b$ must be raised to produce $x$ . For example, since $1000 = 10 3$ , the logarithm base $10$ of $1000$ is $3$ , or $log 10 (1000) = 3$ . The logarithm of $x$ to base $b$ is denoted as $log b (x)$ , or without parentheses, $log b x$ . When the base is clear from the context or is irrelevant it is sometimes written $log x$ .

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 frequently used in computer science. (Full article...)
Image 4

A stamp of Zhang Heng issued by China Post in 1955

Zhang Heng (Chinese: 張衡; AD 78–139), formerly romanized Chang Heng, was a Chinese polymathic scientist and statesman who lived during the Han dynasty. Educated in the capital cities of Luoyang and Chang'an, he achieved success as an astronomer, mathematician, seismologist, hydraulic engineer, inventor, geographer, cartographer, ethnographer, artist, poet, philosopher, politician, and literary scholar.

Zhang Heng began his career as a minor civil servant in Nanyang. Eventually, he became Chief Astronomer, Prefect of the Majors for Official Carriages, and then Palace Attendant at the imperial court. His uncompromising stance on historical and calendrical issues led to his becoming a controversial figure, preventing him from rising to the status of Grand Historian. His political rivalry with the palace eunuchs during the reign of Emperor Shun (r. 125–144) led to his decision to retire from the central court to serve as an administrator of Hejian Kingdom in present-day Hebei. Zhang returned home to Nanyang for a short time, before being recalled to serve in the capital once more in 138. He died there a year later, in 139. (Full article...)
Image 5

Cantor, c. 1910

Georg Ferdinand Ludwig Philipp Cantor (/ˈkæntɔːr/ KAN-tor; German: [ˈɡeːɔʁk ˈfɛʁdinant ˈluːtvɪç ˈfiːlɪp ˈkantoːɐ̯]; 3 March [O.S. 19 February] 1845 – 6 January 1918) was a mathematician who played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between the members of two sets, defined infinite and well-ordered sets, and proved that the real numbers are more numerous than the natural numbers. Cantor's method of proof of this theorem implies the existence of an infinity of infinities. He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact he was well aware of.

Originally, Cantor's theory of transfinite numbers was regarded as counter-intuitive – even shocking. This caused it to encounter resistance from mathematical contemporaries such as Leopold Kronecker and Henri Poincaré and later from Hermann Weyl and L. E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections; see Controversy over Cantor's theory. Cantor, a devout Lutheran Christian, believed the theory had been communicated to him by God. Some Christian theologians (particularly neo-Scholastics) saw Cantor's work as a challenge to the uniqueness of the absolute infinity in the nature of God – on one occasion equating the theory of transfinite numbers with pantheism – a proposition that Cantor vigorously rejected. Not all theologians were against Cantor's theory; prominent neo-scholastic philosopher Constantin Gutberlet was in favor of it and Cardinal Johann Baptist Franzelin accepted it as a valid theory (after Cantor made some important clarifications). (Full article...)
Image 6

Archimedes Thoughtful
by Domenico Fetti (1620)

Archimedes of Syracuse (/ˌɑːrkɪˈmiːdiːz/ AR-kim-EE-deez; c. 287 – c. 212 BC) was an Ancient Greek mathematician, physicist, engineer, astronomer, and inventor from the ancient city of Syracuse in Sicily. Although few details of his life are known, he is regarded as one of the leading scientists in classical antiquity. Considered the greatest mathematician of ancient history, and one of the greatest of all time, Archimedes anticipated modern calculus and analysis by applying the concept of the infinitely small and the method of exhaustion to derive and rigorously prove a range of geometrical theorems. These include the area of a circle, the surface area and volume of a sphere, the area of an ellipse, the area under a parabola, the volume of a segment of a paraboloid of revolution, the volume of a segment of a hyperboloid of revolution, and the area of a spiral.

Archimedes' other mathematical achievements include deriving an approximation of pi, defining and investigating the Archimedean spiral, and devising a system using exponentiation for expressing very large numbers. He was also one of the first to apply mathematics to physical phenomena, working on statics and hydrostatics. Archimedes' achievements in this area include a proof of the law of the lever, the widespread use of the concept of center of gravity, and the enunciation of the law of buoyancy known as Archimedes' principle. He is also credited with designing innovative machines, such as his screw pump, compound pulleys, and defensive war machines to protect his native Syracuse from invasion. (Full article...)
Image 7
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 8

Kaczynski after his arrest in 1996

Theodore John Kaczynski (/kəˈzɪnski/ kə-ZIN-skee; May 22, 1942 – June 10, 2023), also known as the Unabomber (/ˈjuːnəbɒmər/ YOO-nə-bom-ər), was an American mathematician and domestic terrorist. He was a mathematics prodigy, but abandoned his academic career in 1969 to pursue a reclusive primitive lifestyle.

Kaczynski murdered three people and injured 23 others between 1978 and 1995 in a nationwide mail bombing campaign against people he believed to be advancing modern technology and the destruction of the natural environment. He authored Industrial Society and Its Future, a 35,000-word manifesto and social critique which opposes all forms of technology, rejecting leftism, and advocating a nature-centered form of anarchism. (Full article...)
Image 9

Title page of the first edition of Wright's Certaine Errors in Navigation (1599)

Edward Wright (baptised 8 October 1561; died November 1615) was an English mathematician and cartographer noted for his book Certaine Errors in Navigation (1599; 2nd ed., 1610), which for the first time explained the mathematical basis of the Mercator projection by building on the works of Pedro Nunes, and set out a reference table giving the linear scale multiplication factor as a function of latitude, calculated for each minute of arc up to a latitude of 75°. This was in fact a table of values of the integral of the secant function, and was the essential step needed to make practical both the making and the navigational use of Mercator charts.

Wright was born at Garveston in Norfolk and educated at Gonville and Caius College, Cambridge, where he became a fellow from 1587 to 1596. In 1589 the college granted him leave after Elizabeth I requested that he carry out navigational studies with a raiding expedition organised by the Earl of Cumberland to the Azores to capture Spanish galleons. The expedition's route was the subject of the first map to be prepared according to Wright's projection, which was published in Certaine Errors in 1599. The same year, Wright created and published the first world map produced in England and the first to use the Mercator projection since Gerardus Mercator's original 1569 map. (Full article...)
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
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 12
In classical mechanics, the Laplace–Runge–Lenz (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.

The 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 13
The first 15,000 partial sums of 0 + 1 − 2 + 3 − 4 + ... The graph is situated with positive integers to the right and negative integers to the left.

In mathematics, 1 − 2 + 3 − 4 + ··· is an infinite series whose terms are the successive positive integers, given alternating signs. Using sigma summation notation the sum of the first m terms of the series can be expressed as
$\sum _{n=1}^{m}n(-1)^{n-1}.$

The infinite series diverges, meaning that its sequence of partial sums, (1, −1, 2, −2, 3, ...), does not tend towards any finite limit. Nonetheless, in the mid-18th century, Leonhard Euler wrote what he admitted to be a paradoxical equation:
$1-2+3-4+\cdots ={\frac {1}{4}}.$ (Full article...)
Image 14

Hilary Putnam

The Quine–Putnam indispensability argument is an argument in the philosophy of mathematics for the existence of abstract mathematical objects such as numbers and sets, a position known as mathematical platonism. It was named after the philosophers Willard Quine and Hilary Putnam, and is one of the most important arguments in the philosophy of mathematics.

Although elements of the indispensability argument may have originated with thinkers such as Gottlob Frege and Kurt Gödel, Quine's development of the argument was unique for introducing to it a number of his philosophical positions such as naturalism, confirmational holism, and the criterion of ontological commitment. Putnam gave Quine's argument its first detailed formulation in his 1971 book Philosophy of Logic. He later came to disagree with various aspects of Quine's thinking, however, and formulated his own indispensability argument based on the no miracles argument in the philosophy of science. A standard form of the argument in contemporary philosophy is credited to Mark Colyvan; whilst being influenced by both Quine and Putnam, it differs in important ways from their formulations. It is presented in the Stanford Encyclopedia of Philosophy: (Full article...)
$Image 15 Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300). In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements (c. 300 BC). It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations. The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as 252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 252 − 105 = 147. Since this replacement reduces the larger of the two numbers, repeating this process gives successively smaller pairs of numbers until the two numbers become equal. When that occurs, 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 15
Euclid's method for finding the greatest common divisor (GCD) of two starting lengths BA and DC, both defined to be multiples of a common "unit" length. The length DC being shorter, it is used to "measure" BA, but only once because the remainder EA is less than DC. EA now measures (twice) the shorter length DC, with remainder FC shorter than EA. Then FC measures (three times) length EA. Because there is no remainder, the process ends with FC being the GCD. On the right Nicomachus's example with numbers 49 and 21 resulting in their GCD of 7 (derived from Heath 1908:300).

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

The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not change if the larger number is replaced by its difference with the smaller number. For example, 21 is the GCD of 252 and 105 (as $252 = 21 \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...)

More featured articles

edit

Selected image – show another

Line integral

Credit: Lucas V. Barbosa

A line integral is an integral where the function to be integrated, be it a scalar field as here or a vector field, is evaluated along a curve. The value of the line integral is the sum of values of the field at all points on the curve, weighted by some scalar function on the curve (commonly arc length or, for a vector field, the scalar product of the vector field with a differential vector in the curve). A detailed explanation of the animation is available. The key insight is that line integrals may be reduced to simpler definite integrals. (See also a similar animation illustrating a line integral of a vector field.) Many formulas in elementary physics (for example,

W = F \cdot s

to find the work done by a constant force

F

in moving an object through a displacement

s

) have line integral versions that work for non-constant quantities (for example,

W = \int C F \cdot d s

to find the work done in moving an object along a curve C within a continuously varying gravitational or electric field

F

). A higher-dimensional analog of a line integral is a surface integral, where the (double) integral is taken over a two-dimensional surface instead of along a one-dimensional curve. Surface integrals can also be thought of as generalizations of multiple integrals. All of these can be seen as special cases of integrating a differential form, a viewpoint which allows multivariable calculus to be done independently of the choice of coordinate system. While the elementary notions upon which integration is based date back centuries before Newton and Leibniz independently invented calculus, line and surface integrals were formalized in the 18th and 19th centuries as the subject was placed on a rigorous mathematical foundation. The modern notion of differential forms, used extensively in differential geometry and quantum physics, was pioneered by Élie Cartan in the late 19th century.

More selected pictures

Good articles – load new batch

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

Image 1
Convergence of a convex curve to a circle under the curve-shortening flow. Inner curves (lighter color) are flowed versions of the outer curves. Time steps between curves are not uniform.

In mathematics, the curve-shortening flow is a process that modifies a smooth curve in the Euclidean plane by moving its points perpendicularly to the curve at a speed proportional to the curvature. The curve-shortening flow is an example of a geometric flow, and is the one-dimensional case of the mean curvature flow. Other names for the same process include the Euclidean shortening flow, geometric heat flow, and arc length evolution.

As the points of any smooth simple closed curve move in this way, the curve remains simple and smooth. It loses area at a constant rate, and its perimeter decreases as quickly as possible for any continuous curve evolution. If the curve is non-convex, its total absolute curvature decreases monotonically, until it becomes convex. Once convex, the isoperimetric ratio of the curve decreases as the curve converges to a circular shape, before collapsing to a singularity. If two disjoint simple smooth closed curves evolve, they remain disjoint until one of them collapses to a point.
The circle is the only simple closed curve that maintains its shape under the curve-shortening flow, but some curves that cross themselves or have infinite length keep their shape, including the grim reaper curve, an infinite curve that translates upwards, and spirals that rotate while remaining the same size and shape. (Full article...)
Image 2
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...)
Image 3
The integer number line, a set of infinitely many points with integer distances. According to the Erdős–Anning theorem, any such set lies on a line.

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

The theorem is named after Paul Erdős and Norman H. Anning, who published a proof of it in 1945. Erdős later supplied a simpler proof, which can also be used to check whether a point set forms an Erdős–Diophantine graph, an inextensible system of integer points with integer distances. The Erdős–Anning theorem inspired the Erdős–Ulam problem on the existence of dense point sets with rational distances. (Full article...)
Image 4
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 5
In mathematics, the factorial of a non-negative integer $n$ , denoted by $n!$ , is the product of all positive integers less than or equal to $n$ . The factorial of $n$ also equals the product of $n$ with the next smaller factorial:
$<br>{\begin{aligned}n!&=n\times (n-1)\times (n-2)\times (n-3)\times \cdots \times 3\times 2\times 1\\<br>&=n\times (n-1)!\\<br>\end{aligned}}$
For example,
$5!=5\times 4!=5\times 4\times 3\times 2\times 1=120.$
The value of 0! is 1, according to the convention for an empty product.

Factorials have been discovered in several ancient cultures, notably in Indian mathematics in the canonical works of Jain literature, and by Jewish mystics in the Talmudic book Sefer Yetzirah. The factorial operation is encountered in many areas of mathematics, notably in combinatorics, where its most basic use counts the possible distinct sequences – the permutations – of $n$ distinct objects: there are $n!$ . In mathematical analysis, factorials are used in power series for the exponential function and other functions, and they also have applications in algebra, number theory, probability theory, and computer science. (Full article...)
Image 6

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

Sir Edmund Taylor Whittaker (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 7
Geometric representation of the square pyramidal number 1 + 4 + 9 + 16 = 30.

In mathematics, a pyramid number, or square pyramidal number, is a natural number that counts the stacked spheres in a pyramid with a square base. The study of these numbers goes back to Archimedes and Fibonacci. They are part of a broader topic of figurate numbers representing the numbers of points forming regular patterns within different shapes.

As well as counting spheres in a pyramid, these numbers can be described algebraically as a sum of the first $n$ positive square numbers, or as the values of a cubic polynomial. They can be used to solve several other counting problems, including counting squares in a square grid and counting acute triangles formed from the vertices of an odd regular polygon. They equal the sums of consecutive tetrahedral numbers, and are one-fourth of a larger tetrahedral number. The sum of two consecutive square pyramidal numbers is an octahedral number. (Full article...)
Image 8
Farey sunburst of order 6, with 1 interior (red) and 96 boundary (green) points giving an area of 1 + ⁠96/2⁠ − 1 = 48

In geometry, Pick's theorem provides a formula for the area of a simple polygon with integer vertex coordinates, in terms of the number of integer points within it and on its boundary. The result was first described by Georg Alexander Pick in 1899. It was popularized in English by Hugo Steinhaus in the 1950 edition of his book Mathematical Snapshots. It has multiple proofs, and can be generalized to formulas for certain kinds of non-simple polygons. (Full article...)
Image 9
Selected witch of Agnesi curves (green), and the circles they are constructed from (blue), with radius parameters $a=1$ , $a=2$ , $a=4$ , and $a=8$ .

In mathematics, the witch of Agnesi (Italian pronunciation: [aɲˈɲeːzi, -eːsi; -ɛːzi]) is a cubic plane curve defined from two diametrically opposite points of a circle.

The curve was studied as early as 1653 by Pierre de Fermat, in 1703 by Guido Grandi, and by Isaac Newton. It gets its name from Italian mathematician Maria Gaetana Agnesi who published it in 1748. The Italian name la versiera di Agnesi is based on Latin versoria (sheet of sailing ships) and the sinus versus.
This was read by John Colson as l’avversiera di Agnesi, where avversiera is translated as "woman who is against God" and interpreted as "witch". (Full article...)
Image 10
Six points in the unit square, with the smallest triangles (red) having area 1/8, the optimal area for this number of points. Other larger triangles are colored blue. These points are an affine transformation of a regular hexagon, but for larger numbers of points the optimal solution does not form a convex polygon.

In discrete geometry and discrepancy theory, the Heilbronn triangle problem is a problem of placing points in the plane, avoiding triangles of small area. It is named after Hans Heilbronn, who conjectured that, no matter how points are placed in a given area, the smallest triangle area will be at most inversely proportional to the square of the number of points. His conjecture was proven false, but the asymptotic growth rate of the minimum triangle area remains unknown. (Full article...)
Image 11
The Rado graph, as numbered by Ackermann (1937) and Rado (1964).

In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with probability one) by choosing independently at random for each pair of its vertices whether to connect the vertices by an edge. The names of this graph honor Richard Rado, Paul Erdős, and Alfréd Rényi, mathematicians who studied it in the early 1960s; it appears even earlier in the work of Wilhelm Ackermann (1937). The Rado graph can also be constructed non-randomly, by symmetrizing the membership relation of the hereditarily finite sets, by applying the BIT predicate to the binary representations of the natural numbers, or as an infinite Paley graph that has edges connecting pairs of prime numbers congruent to 1 mod 4 that are quadratic residues modulo each other.

Every finite or countably infinite graph is an induced subgraph of the Rado graph, and can be found as an induced subgraph by a greedy algorithm that builds up the subgraph one vertex at a time. The Rado graph is uniquely defined, among countable graphs, by an extension property that guarantees the correctness of this algorithm: no matter which vertices have already been chosen to form part of the induced subgraph, and no matter what pattern of adjacencies is needed to extend the subgraph by one more vertex, there will always exist another vertex with that pattern of adjacencies that the greedy algorithm can choose. (Full article...)
Image 12

Isosceles triangle with vertical axis of symmetry

In geometry, an isosceles triangle (/aɪˈsɒsəliːz/) is a triangle that has two sides of equal length. Sometimes it is specified as having exactly two sides of equal length, and sometimes as having at least two sides of equal length, the latter version thus including the equilateral triangle as a special case.
Examples of isosceles triangles include the isosceles right triangle, the golden triangle, and the faces of bipyramids and certain Catalan solids.

The mathematical study of isosceles triangles dates back to ancient Egyptian mathematics and Babylonian mathematics. Isosceles triangles have been used as decoration from even earlier times, and appear frequently in architecture and design, for instance in the pediments and gables of buildings. (Full article...)

More good articles

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

... that after Archimedes first defined convex curves, mathematicians lost interest in their analysis until the 19th century, more than two millennia later?
... that despite a mathematical model deeming the ice cream bar flavour Goody Goody Gum Drops impossible, it was still created?
... that Fathimath Dheema Ali is the first Olympic qualifier from the Maldives?
... that mathematician Mathias Metternich was one of the founders of the Jacobin club of the Republic of Mainz?
... that after Florida schools banned 54 mathematics books, Chaz Stevens petitioned that they also ban the Bible?
... that the music of math rock band Jyocho has been alternatively described as akin to "madness" or "contemplative and melancholy"?
... 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 Latvian-Soviet artist Karlis Johansons exhibited a skeletal tensegrity form of the Schönhardt polyhedron seven years before Erich Schönhardt's 1928 paper on its mathematics?

edit

More did you know – view different entries

Did you know...

... that the Herschel graph is the smallest possible polyhedral graph that does not have a Hamiltonian cycle?
... that the Life without Death cellular automaton, a mathematical model of pattern formation, is a variant of Conway's Game of Life in which cells, once brought to life, never die?
... that one can list every positive rational number without repetition by breadth-first traversal of the Calkin–Wilf tree?
... that the Hadwiger conjecture implies that the external surface of any three-dimensional convex body can be illuminated by only eight light sources, but the best proven bound is that 16 lights are sufficient?
... that an equitable coloring of a graph, in which the numbers of vertices of each color are as nearly equal as possible, may require far more colors than a graph coloring without this constraint?
... that no matter how biased a coin one uses, flipping a coin to determine whether each edge is present or absent in a countably infinite graph will always produce the same graph, the Rado graph?
...that it is possible to stack identical dominoes off the edge of a table to create an arbitrarily large overhang?

More did you know facts

Showing 7 items out of 75

edit

Selected article – show another

A Hilbert space is a real or complex vector space with a positive-definite Hermitian form, that is complete under its norm. Thus it is an inner product space, which means that it has notions of distance and of angle (especially the notion of orthogonality or perpendicularity). The completeness requirement ensures that for infinite dimensional Hilbert spaces the limits exist when expected, which facilitates various definitions from calculus. A typical example of a Hilbert space is the space of square summable sequences.

Hilbert spaces allow simple geometric concepts, like projection and change of basis to be applied to infinite dimensional spaces, such as function spaces. They provide a context with which to formalize and generalize the concepts of the Fourier series in terms of arbitrary orthogonal polynomials and of the Fourier transform, which are central concepts from functional analysis. Hilbert spaces are of crucial importance in the mathematical formulation of quantum mechanics. (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