Portal:Mathematics

The Mathematics Portal

Euler's Identity

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 –

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

---

• 

  

  The regular triangular tiling of the plane, whose symmetries are described by the affine symmetric group S̃₃

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

  

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

  

  Rejewski, c. 1932

  
  Marian Adam Rejewski (Polish: [ˈmarjan rɛˈjɛfskʲi] ^ⓘ; 16 August 1905 – 13 February 1980) was a Polish mathematician and cryptologist who in late 1932 reconstructed the sight-unseen Nazi German military Enigma cipher machine, aided by limited documents obtained by French military intelligence. Over the next nearly seven years, Rejewski and fellow mathematician-cryptologists Jerzy Różycki and Henryk Zygalski developed and used techniques and equipment to decrypt the German machine ciphers, even as the Germans introduced modifications to their equipment and encryption procedures. Five weeks before the outbreak of World War II in Europe, the Poles shared their technological achievements with the French and British at a conference in Warsaw, thus enabling Britain to begin reading German Enigma-encrypted messages, seven years after Rejewski's original reconstruction of the machine. The intelligence that was gained by the British from Enigma decrypts formed part of what was code-named Ultra and contributed—perhaps decisively—to the defeat of Nazi Germany.
  
  In 1929, while studying mathematics at Poznań University, Rejewski attended a secret cryptology course conducted by the Polish General Staff's Cipher Bureau (Biuro Szyfrów), which he joined in September 1932. The Bureau had had no success in reading Enigma-enciphered messages and set Rejewski to work on the problem in late 1932; he deduced the machine's secret internal wiring after only a few weeks. Rejewski and his two colleagues then developed successive techniques for the regular decryption of Enigma messages. His own contributions included the cryptologic card catalog, derived using the cyclometer that he had invented, and the cryptologic bomb. (Full article...)
• 

  

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

  

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

  

  One of Molyneux's celestial globes, which is displayed in Middle Temple Library – from the frontispiece of the Hakluyt Society's 1889 reprint of A Learned Treatise of Globes, both Cœlestiall and Terrestriall, one of the English editions of Robert Hues' Latin work Tractatus de Globis (1594)

  
  Emery Molyneux (/ˈɛməri ˈmɒlɪnoʊ/ EM-ər-ee MOL-in-oh; died June 1598) was an English Elizabethan maker of globes, mathematical instruments and ordnance. His terrestrial and celestial globes, first published in 1592, were the first to be made in England and the first to be made by an Englishman.
  
  Molyneux was known as a mathematician and maker of mathematical instruments such as compasses and hourglasses. He became acquainted with many prominent men of the day, including the writer Richard Hakluyt and the mathematicians Robert Hues and Edward Wright. He also knew the explorers Thomas Cavendish, Francis Drake, Walter Raleigh and John Davis. Davis probably introduced Molyneux to his own patron, the London merchant William Sanderson, who largely financed the construction of the globes. When completed, the globes were presented to Elizabeth I. Larger globes were acquired by royalty, noblemen and academic institutions, while smaller ones were purchased as practical navigation aids for sailors and students. The globes were the first to be made in such a way that they were unaffected by the humidity at sea, and they came into general use on ships. (Full article...)
• 
  
  

  

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

  

  The repeating decimal continues infinitely.

  
  
  In mathematics, 0.999... (also written as 0.9, 0..9 or 0.(9)) is a notation for the repeating decimal consisting of an unending sequence of 9s after the decimal point. This repeating decimal is a numeral that represents the smallest number no less than every number in the sequence (0.9, 0.99, 0.999, ...); that is, the supremum of this sequence. This number is equal to 1. In other words, "0.999..." is not "almost exactly" or "very, very nearly but not quite" 1  –  rather, "0.999..." and "1" represent exactly the same number.
  
  There are many ways of showing this equality, from intuitive arguments to mathematically rigorous proofs. The technique used depends on the target audience, background assumptions, historical context, and preferred development of the real numbers, the system within which 0.999... is commonly defined. In other systems, 0.999... can have the same meaning, a different definition, or be undefined. (Full article...)
• 
  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...)
• 
  
  

  

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

Selected image –

a smooth surface, vaguely conical in shape and embedded in a basket-like mesh of points, rotates in empty space

Non-uniform rational B-spline

Credit: Greg L

Non-uniform rational B-splines (NURBS) are commonly used in computer graphics for generating and representing curves and surfaces for both analytic shapes (described by mathematical formulas) and modeled shapes. Here the shape of the surface is determined by control points, shown as small spheres surrounding the surface itself. The square at the bottom sets the maximum width and length of the surface. Based on early work by Pierre Bézier and Paul de Casteljau, NURBS are generalizations of both B-splines (basis splines) and Bézier curves and surfaces. Unlike simple Bézier curves and surfaces, which are non-rational, NURBS can represent exactly certain analytic shapes such as conic sections and spherical sections. They are widely used in computer-aided design (CAD), manufacturing (CAM), and engineering (CAE), although T-splines and subdivision surfaces may be more suitable for more complex organic shapes.

Good articles –

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

---

• 

  

  Two right triangles with the two legs of the top one equal to the leg and hypotenuse of the bottom one. For these lengths, $a^{2}$, $b^{2}$, and $c^{2}$ form an arithmetic progression separated by a gap of $d^{2}$. It is not possible for all four lengths $a$, $b$, $c$, and $d$ to be integers.

  
  Fermat's right triangle theorem is a non-existence proof in number theory, published in 1670 among the works of Pierre de Fermat, soon after his death. It is the only complete proof given by Fermat. It has several equivalent formulations, one of which was stated (but not proved) in 1225 by Fibonacci. In its geometric forms, it states:

  • A right triangle in the Euclidean plane for which all three side lengths are rational numbers cannot have an area that is the square of a rational number. The area of a rational-sided right triangle is called a congruent number, so no congruent number can be square.
  • A right triangle and a square with equal areas cannot have all sides commensurate with each other.
  • There do not exist two integer-sided right triangles in which the two legs of one triangle are the leg and hypotenuse of the other triangle.

  
  More abstractly, as a result about Diophantine equations (integer or rational-number solutions to polynomial equations), it is equivalent to the statements that:

  • If three square numbers form an arithmetic progression, then the gap between consecutive numbers in the progression (called a congruum) cannot itself be square.
  • The only rational points on the elliptic curve $y^{2}=x(x-1)(x+1)$ are the three trivial points with $x\in \{-1,0,1\}$ and $y=0$.
  • The quartic equation $x^{4}-y^{4}=z^{2}$ has no nonzero integer solution.

  
  An immediate consequence of the last of these formulations is that Fermat's Last Theorem is true in the special case that its exponent is 4. (Full article...)
• 
  In geometry, the Beckman–Quarles theorem states that if a transformation of the Euclidean plane or a higher-dimensional Euclidean space preserves unit distances, then it preserves all Euclidean distances. Equivalently, every homomorphism from the unit distance graph of the plane to itself must be an isometry of the plane. The theorem is named after Frank S. Beckman and Donald A. Quarles Jr., who published this result in 1953; it was later rediscovered by other authors and re-proved in multiple ways. Analogous theorems for rational subsets of Euclidean spaces, or for non-Euclidean geometry, are also known. (Full article...)
• 
  Advanced Placement (AP) Statistics (also known as AP Stats) is a college-level high school statistics course offered in the United States through the College Board's Advanced Placement program. This course is equivalent to a one semester, non-calculus-based introductory college statistics course and is normally offered to sophomores, juniors and seniors in high school.
  
  One of the College Board's more recent additions, the AP Statistics exam was first administered in May 1996 to supplement the AP program's math offerings, which had previously consisted of only AP Calculus AB and BC. In the United States, enrollment in AP Statistics classes has increased at a higher rate than in any other AP class. (Full article...)
• 

  

  Two greedy colorings of the same crown graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors.

  
  In the study of graph coloring problems in mathematics and computer science, a greedy coloring or sequential coloring is a coloring of the vertices of a graph formed by a greedy algorithm that considers the vertices of the graph in sequence and assigns each vertex its first available color. Greedy colorings can be found in linear time, but they do not, in general, use the minimum number of colors possible.
  
  Different choices of the sequence of vertices will typically produce different colorings of the given graph, so much of the study of greedy colorings has concerned how to find a good ordering. There always exists an ordering that produces an optimal coloring, but although such orderings can be found for many special classes of graphs, they are hard to find in general. Commonly used strategies for vertex ordering involve placing higher-degree vertices earlier than lower-degree vertices, or choosing vertices with fewer available colors in preference to vertices that are less constrained. (Full article...)
• 
  Klaus Friedrich Roth FRS (29 October 1925 – 10 November 2015) was a German-born British mathematician who won the Fields Medal for proving Roth's theorem on the Diophantine approximation of algebraic numbers. He was also a winner of the De Morgan Medal and the Sylvester Medal, and a Fellow of the Royal Society.
  
  Roth moved to England as a child in 1933 to escape the Nazis, and was educated at the University of Cambridge and University College London, finishing his doctorate in 1950. He taught at University College London until 1966, when he took a chair at Imperial College London. He retired in 1988. (Full article...)
• 
  Ronald Paul "Ron" Fedkiw (born February 27, 1968) is a full professor in the Stanford University department of computer science and a leading researcher in the field of computer graphics, focusing on topics relating to physically based simulation of natural phenomena and machine learning. His techniques have been employed in many motion pictures. He has earned recognition at the 80th Academy Awards and the 87th Academy Awards as well as from the National Academy of Sciences.
  
  His first Academy Award was awarded for developing techniques that enabled many technically sophisticated adaptations including the visual effects in 21st century movies in the Star Wars, Harry Potter, Terminator, and Pirates of the Caribbean franchises. Fedkiw has designed a platform that has been used to create many of the movie world's most advanced special effects since it was first used on the T-X character in Terminator 3: Rise of the Machines. His second Academy Award was awarded for computer graphics techniques for special effects for large scale destruction. Although he has won an Oscar for his work, he does not design the visual effects that use his technique. Instead, he has developed a system that other award-winning technicians and engineers have used to create visual effects for some of the world's most expensive and highest-grossing movies. (Full article...)
• 
  Mathematical economics is the application of mathematical methods to represent theories and analyze problems in economics. Often, these applied methods are beyond simple geometry, and may include differential and integral calculus, difference and differential equations, matrix algebra, mathematical programming, or other computational methods. Proponents of this approach claim that it allows the formulation of theoretical relationships with rigor, generality, and simplicity.
  
  Mathematics allows economists to form meaningful, testable propositions about wide-ranging and complex subjects which could less easily be expressed informally. Further, the language of mathematics allows economists to make specific, positive claims about controversial or contentious subjects that would be impossible without mathematics. Much of economic theory is currently presented in terms of mathematical economic models, a set of stylized and simplified mathematical relationships asserted to clarify assumptions and implications. (Full article...)
• 

  

  Hendrik Antoon Lorentz (right) after whom the Lorentz group is named and Albert Einstein whose special theory of relativity is the main source of application. Photo taken by Paul Ehrenfest 1921.

  
  
  The Lorentz group is a Lie group of symmetries of the spacetime of special relativity. This group can be realized as a collection of matrices, linear transformations, or unitary operators on some Hilbert space; it has a variety of representations. This group is significant because special relativity together with quantum mechanics are the two physical theories that are most thoroughly established, and the conjunction of these two theories is the study of the infinite-dimensional unitary representations of the Lorentz group. These have both historical importance in mainstream physics, as well as connections to more speculative present-day theories. (Full article...)
• 
  
  

  

  Equilateral form of the Cairo tiling

  
  In geometry, a Cairo pentagonal tiling is a tessellation of the Euclidean plane by congruent convex pentagons, formed by overlaying two tessellations of the plane by hexagons and named for its use as a paving design in Cairo. It is also called MacMahon's net after Percy Alexander MacMahon, who depicted it in his 1921 publication New Mathematical Pastimes. John Horton Conway called it a 4-fold pentille.
  
  Infinitely many different pentagons can form this pattern, belonging to two of the 15 families of convex pentagons that can tile the plane. Their tilings have varying symmetries; all are face-symmetric. One particular form of the tiling, dual to the snub square tiling, has tiles with the minimum possible perimeter among all pentagonal tilings. Another, overlaying two flattened tilings by regular hexagons, is the form used in Cairo and has the property that every edge is collinear with infinitely many other edges. (Full article...)
• 

  

  An anti­parallelogram

  
  
  In geometry, an antiparallelogram is a type of self-crossing quadrilateral. Like a parallelogram, an antiparallelogram has two opposite pairs of equal-length sides, but these pairs of sides are not in general parallel. Instead, each pair of sides is antiparallel with respect to the other, with sides in the longer pair crossing each other as in a scissors mechanism. Whereas a parallelogram's opposite angles are equal and oriented the same way, an antiparallelogram's are equal but oppositely oriented. Antiparallelograms are also called contraparallelograms or crossed parallelograms.
  
  Antiparallelograms occur as the vertex figures of certain nonconvex uniform polyhedra. In the theory of four-bar linkages, the linkages with the form of an antiparallelogram are also called butterfly linkages or bow-tie linkages, and are used in the design of non-circular gears. In celestial mechanics, they occur in certain families of solutions to the 4-body problem. (Full article...)
• 

  

  A Penrose tiling with rhombi exhibiting fivefold symmetry

  
  A Penrose tiling is an example of an aperiodic tiling. Here, a tiling is a covering of the plane by non-overlapping polygons or other shapes, and a tiling is aperiodic if it does not contain arbitrarily large periodic regions or patches. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s.
  
  There are several variants of Penrose tilings with different tile shapes. The original form of Penrose tiling used tiles of four different shapes, but this was later reduced to only two shapes: either two different rhombi, or two different quadrilaterals called kites and darts. The Penrose tilings are obtained by constraining the ways in which these shapes are allowed to fit together in a way that avoids periodic tiling. This may be done in several different ways, including matching rules, substitution tiling or finite subdivision rules, cut and project schemes, and coverings. Even constrained in this manner, each variation yields infinitely many different Penrose tilings. (Full article...)
• 
  In mathematics, a square-difference-free set is a set of natural numbers, no two of which differ by a square number. Hillel Furstenberg and András Sárközy proved in the late 1970s the Furstenberg–Sárközy theorem of additive number theory showing that, in a certain sense, these sets cannot be very large. In the game of subtract a square, the positions where the next player loses form a square-difference-free set. Another square-difference-free set is obtained by doubling the Moser–de Bruijn sequence.
  
  The best known upper bound on the size of a square-difference-free set of numbers up to $n$ is only slightly sublinear, but the largest known sets of this form are significantly smaller, of size $\approx n^{0.733412}$. Closing the gap between these upper and lower bounds remains an open problem. The sublinear size bounds on square-difference-free sets can be generalized to sets where certain other polynomials are forbidden as differences between pairs of elements. (Full article...)

Did you know (auto-generated) –

• ... that the mathematical infinity symbol ∞ may be derived from the Roman numerals for 1000 or for 100 million?
• ... that mathematician Gunilla Kreiss, the daughter of Heinz-Otto Kreiss, later became his granddaughter?
• ... that multiple mathematics competitions have made use of Sophie Germain's identity?
• ... that museum director Alena Aladava rebuilt the Belarusian national art collection in the aftermath of the Second World War?
• ... that despite a mathematical model deeming the ice cream bar flavour Goody Goody Gum Drops impossible, it was still created?
• ... that in the aftermath of the American Civil War, the only Black-led organization providing teachers to formerly enslaved people was the African Civilization Society?
• ... that although the problem of squaring the circle with compass and straightedge goes back to Greek mathematics, it was not proven impossible until 1882?
• ... that Donn Piatt threw his mathematics teacher out of the window?

More did you know –

Did you know...

• ...that a ball can be cut up and reassembled into two balls, each the same size as the original (Banach-Tarski paradox)?
• ...that it is impossible to devise a single formula involving only polynomials and radicals for solving an arbitrary quintic equation?
• ...that Euler found 59 more amicable numbers while for 2000 years, only 3 pairs had been found before him?
• ...that you cannot knot strings in 4 dimensions, but you can knot 2-dimensional surfaces, such as spheres?
• ...that there are 6 unsolved mathematics problems whose solutions will earn you one million US dollars each?
• ...that there are different sizes of infinite sets in set theory? More precisely, not all infinite cardinal numbers are equal?
• ...that every natural number can be written as the sum of four squares?

Selected article –

The real part (red) and imaginary part (blue) of the critical line Re(s) = 1/2 of the Riemann zeta-function. Image credit: User:Army1987

The Riemann hypothesis, first formulated by Bernhard Riemann in 1859, is one of the most famous unsolved problems. It has been an open question for well over a century, despite attracting concentrated efforts from many outstanding mathematicians.

The Riemann hypothesis is a conjecture about the distribution of the zeros of the Riemann zeta-function ζ(s). The Riemann zeta-function is defined for all complex numbers s ≠ 1. It has zeros at the negative even integers (i.e. at s=-2, s=-4, s=-6, ...). These are called the trivial zeros. The Riemann hypothesis is concerned with the non-trivial zeros, and states that:

The real part of any non-trivial zero of the Riemann zeta function is ½

Thus the non-trivial zeros should lie on the so-called critical line ½ + it with t a real number and i the imaginary unit. The Riemann zeta-function along the critical line is sometimes studied in terms of the Z-function, whose real zeros correspond to the zeros of the zeta-function on the critical line.

The Riemann hypothesis is one of the most important open problems in contemporary mathematics; a $1,000,000 prize has been offered by the Clay Mathematics Institute for a proof. Most mathematicians believe the Riemann hypothesis to be true. (J. E. Littlewood and Atle Selberg have been reported as skeptical. Selberg's skepticism, if any, waned, from his young days. In a 1989 paper, he suggested that an analogue should hold for a much wider class of functions, the Selberg class.) (Full article...)

View all selected articles

Subcategories

Algebra | Arithmetic | Analysis | Complex analysis | Applied mathematics | Calculus | Category theory | Chaos theory | Combinatorics | Dynamical systems | Fractals | Game theory | Geometry | Algebraic geometry | Graph theory | Group theory | Linear algebra | Mathematical logic | Model theory | Multi-dimensional geometry | Number theory | Numerical analysis | Optimization | Order theory | Probability and statistics | Set theory | Statistics | Topology | Algebraic topology | Trigonometry | Linear programming

---

Mathematics | History of mathematics | Mathematicians | Awards | Education | Literature | Notation | Organizations | Theorems | Proofs | Unsolved problems

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

Statistical 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

Topics in mathematics

General	Foundations	Number theory	Discrete mathematics
Mathematicians History of mathematics Philosophy of mathematics Mathematical notation Mathematical beauties Mathematics education Areas of mathematics Outline of mathematics Glossary of mathematical symbols	Foundations of mathematics Mathematical logic Proof theory Gödel's incompleteness theorems Model theory Recursion theory Set theory Naive set theory Axiomatic set theory Category theory Topos theory	Number theory Algebraic number theory Analytic number theory Arithmetic Fundamental theorem of arithmetic Numbers Natural numbers Prime numbers Rational numbers Algebraic numbers	Discrete mathematics Combinatorics Combinatorial geometry Coding theory Combinatorial design Enumerative combinatorics Combinatorial optimization Graph theory Order theory Lattice theory Digital Signal Processing Theoretical computer science Computability theory Complexity theory
Algebra	Analysis	Geometry and topology	Applied mathematics
Algebra Elementary algebra Abstract algebra Group theory Ring theory Field theory Commutative algebra Geometric algebra Linear algebra Matrix theory Multilinear algebra Universal algebra Fundamental theorem of algebra	Analysis Calculus Fundamental theorem of calculus Vector calculus Geometric calculus Measure theory Real analysis Complex analysis Differential equations Ordinary differential equations Partial differential equations Integral equations Approximation theory Special functions Potential theory Harmonic analysis Fourier analysis Functional analysis Operator theory	Geometry Euclidean geometry Trigonometry Analytic geometry Non-Euclidean geometry Affine geometry Projective geometry Convex geometry Discrete geometry Algebraic geometry Differential geometry K theory Gauge theory Riemannian geometry Lie groups Topology General topology Algebraic topology Geometric topology Differential topology	Applied mathematics Mathematical modeling Mathematical physics Dynamical systems Control theory Calculus of variations Optimization Mathematical economics Game theory Mathematical finance Statistics Probability theory Stochastic processes Numerical analysis Cryptography Information theory

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

Related portals

WikiProjects

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

Project pages

• Participants
• Current activity
• Manual of style
• Conventions

Essays

• Advice on using Wikipedia for mathematics self-study
• Proofs

Subprojects

• PlanetMath Exchange (Talk)
• Graphics (Talk)
• Article assessment (Talk)

Related projects

Computer science | Cryptography | Game theory | Numbers | Physics | Science | Statistics

Things you can do

• Create a new article: List of requested articles
• Add a new image: Image requests
• Expand an article: Mathematics stubs
• Lend your expertise: Expert attention needed

In other Wikimedia projects

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

• 

  Commons
  Free media repository

• 

  Wikibooks
  Free textbooks and manuals

• 

  Wikidata
  Free knowledge base

• 

  Wikinews
  Free-content news

• 

  Wikiquote
  Collection of quotations

• 

  Wikisource
  Free-content library

• 

  Wikiversity
  Free learning tools

• 

  Wiktionary
  Dictionary and thesaurus

More portals

Discover Wikipedia using portals

• 

  List of all portals

• 

  The arts portal

• 

  Biography portal

• 

  Current events portal

• 

  Geography portal

• 

  History portal

• 

  Mathematics portal

• 

  Science portal

• 

  Society portal

• 

  Technology portal

• 

  Random portal

• 

  WikiProject Portals