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 numbers, quantity, space, pattern, structure, and change. Mathematics is used throughout the world as an essential tool in many fields, including natural science, engineering, medicine, and the social sciences. It is used for calculation and considered as the most important subject. 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)

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

Selected image – show another

Quicksort

Credit: RolandH

Quicksort (also known as the partition-exchange sort) is an efficient sorting algorithm that works for items of any type for which a total order (i.e., "≤") relation is defined. This animation shows how the algorithm partitions the input array (here a random permutation of the numbers 1 through 33) into two smaller arrays based on a selected pivot element (bar marked in red, here always chosen to be the last element in the array under consideration), by swapping elements between the two sub-arrays so that those in the first (on the left) end up all smaller than the pivot element's value (horizontal blue line) and those in the second (on the right) all larger. The pivot element is then moved to a position between the two sub-arrays; at this point, the pivot element is in its final position and will never be moved again. The algorithm then proceeds to recursively apply the same procedure to each of the smaller arrays, partitioning and rearranging the elements until there are no sub-arrays longer than one element left to process. (As can be seen in the animation, the algorithm actually sorts all left-hand sub-arrays first, and then starts to process the right-hand sub-arrays.) First developed by Tony Hoare in 1959, quicksort is still a commonly used algorithm for sorting in computer applications. On the average, it requires

O (n log n)

comparisons to sort

n

items, which compares favorably to other popular sorting methods, including merge sort and heapsort. Unfortunately, on rare occasions (including cases where the input is already sorted or contains items that are all equal) quicksort requires a worst-case

O(n 2)

comparisons, while the other two methods remain

O(n log n)

in their worst cases. Still, when implemented well, quicksort can be about two or three times faster than its main competitors. Unlike merge sort, the standard implementation of quicksort does not preserve the order of equal input items (it is not stable), although stable versions of the algorithm do exist at the expense of requiring

O(n)

additional storage space. Other variations are based on different ways of choosing the pivot element (for example, choosing a random element instead of always using the last one), using more than one pivot, switching to an insertion sort when the sub-arrays have shrunk to a sufficiently small length, and using a three-way partitioning scheme (grouping items into those smaller, larger, and equal to the pivot—a modification that can turn the worst-case scenario of all-equal input values into the best case). Because of the algorithm's "divide and conquer" approach, parts of it can be done in parallel (in particular, the processing of the left and right sub-arrays can be done simultaneously). However, other sorting algorithms (including merge sort) experience much greater speed increases when performed in parallel.

More selected pictures

edit

Did you know – view different entries

...that the 1966 publication disproving Euler's sum of powers conjecture, proposed nearly 200 years earlier, consisted of only two sentences?
...the hyperbolic trigonometric functions of the natural logarithm can be represented by rational algebraic fractions?
... that economists blame market failures on non-convexity?
... that, according to the pizza theorem, a circular pizza that is sliced off-center into eight equal-angled wedges can still be divided equally between two people?
... that the clique problem of programming a computer to find complete subgraphs in an undirected graph was first studied as a way to find groups of people who all know each other in social networks?
... 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?