Before the featured portal process ceased in 2017, this had been designated as a featured portal.
Page semi-protected


From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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

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

Selected image – show another

The knight's tour is a mathematical chess problem in which the piece called the knight is to visit each square on an otherwise empty chess board exactly once, using only legal moves. It is a special case of the more general Hamiltonian path problem in graph theory. (A closely related non-Hamiltonian problem is that of the longest uncrossed knight's path.) The tour is called closed if the knight ends on a square from which it may legally move to its starting square (thereby forming an endless cycle), and open if not. The tour shown in this animation is open (see also a static image of the completed tour). On a standard 8 × 8 board there are 26,534,728,821,064 possible closed tours and 39,183,656,341,959,810 open tours (counting separately any tours that are equivalent by rotation, reflection, or reversing the direction of travel). Although the earliest known solutions to the knight's tour problem date back to the 9th century CE, the first general procedure for completing the knight's tour was Warnsdorff's rule, first described in 1823. The knight's tour was one of many chess puzzles solved by The Turk, a fake chess-playing machine exhibited as an automaton from 1770 to 1854, and exposed in the early 1820s as an elaborate hoax. True chess-playing automatons (i.e., computer programs) appeared in the 1950s, and by 1988 had become sufficiently advanced to win a match against a grandmaster; in 1997, Deep Blue famously became the first computer system to defeat a reigning world champion (Garry Kasparov) in a match under standard tournament time controls. Despite these advances, there is still debate as to whether chess will ever be "solved" as a computer problem (meaning an algorithm will be developed that can never lose a chess match). According to Zermelo's theorem, such an algorithm does exist.

Good articles - load new batch

Symbol support vote.svg  These are Good articles, which meet a core set of high editorial standards.

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

Nuvola apps filetypes.svg

More did you know – view different entries

Did you know...
Showing 7 items out of 75

Selected article – show another

The graph of a real-valued quadratic function of a real variable x, is a parabola.
Image credit: Enoch Lau

A quadratic equation is a polynomial equation of degree two. The general form is

where a ≠ 0 (if a = 0, then the equation becomes a linear equation). The letters a, b, and c are called coefficients: the quadratic coefficient a is the coefficient of x2, the linear coefficient b is the coefficient of x, and c is the constant coefficient, also called the free term.

Quadratic equations are known by that name because quadratus is Latin for "square"; in the leading term the variable is squared.

A quadratic equation has two (not necessarily distinct) solutions, which may be real or complex, given by the quadratic formula:

If the discriminant , then the quadratic equation has two distinct real solutions; if , the equation has two real solutions which are equal; if , the equation has two complex solutions.

These solutions are roots of the corresponding quadratic function

(Full article...)
View all selected articles


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

Topics in mathematics

General Foundations Number theory Discrete mathematics
Nuvola apps bookcase.svg
Set theory icon.svg
Nuvola apps kwin4.png
Nuvola apps atlantik.png

Algebra Analysis Geometry and topology Applied mathematics
Arithmetic symbols.svg
Nuvola apps kpovmodeler.svg

Index of mathematics articles


Related portals


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

In other Wikimedia projects

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

More portals

Discover Wikipedia using portals