Portal:Mathematics
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. 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.
Selected article
Euclidean geometry is a mathematical system attributed to the Greek mathematician Euclid of Alexandria. Euclid's text Elements was the first systematic discussion of geometry. It has been one of the most influential books in history, as much for its method as for its mathematical content. The method consists of assuming a small set of intuitively appealing axioms, and then proving many other propositions (theorems) from those axioms. Although many of Euclid's results had been stated by earlier Greek mathematicians, Euclid was the first to show how these propositions could fit together into a comprehensive deductive and logical system.
The Elements begin with plane geometry, still often taught in secondary school as the first axiomatic system and the first examples of formal proof. The Elements goes on to the solid geometry of three dimensions, and Euclidean geometry was subsequently extended to any finite number of dimensions. Much of the Elements states results of what is now called number theory, proved using geometrical methods.
For over two thousand years, the adjective "Euclidean" was unnecessary because no other sort of geometry had been conceived. Euclid's axioms seemed so intuitively obvious that any theorem proved from them was deemed true in an absolute sense. Today, however, many other self-consistent geometries are known, the first ones having been discovered in the early 19th century. It also is no longer taken for granted that Euclidean geometry describes physical space. An implication of Einstein's theory of general relativity is that Euclidean geometry is only a good approximation to the properties of physical space if the gravitational field is not too strong.
View all selected articles | Read More... |
Selected image
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.
Did you know…
- ...that pi can be computed using only the number 2 by the work of Viète?
- … that every positive integer can be written as the sum of three palindromic numbers in every number system with base 5 or greater?
- … that the best known lower bound for the length of the smallest superpermutation was first posted anonymously to the internet imageboard 4chan?
- ...that the mathematician Grigori Perelman was offered a Fields Medal in 2006, in part for his proof of the Poincaré conjecture, which he declined?
- ...that a regular heptagon is the regular polygon with the fewest sides which is not constructible with a compass and straightedge?
- ...that the Gudermannian function relates the regular trigonometric functions and the hyperbolic trigonometric functions without the use of complex numbers?
WikiProjects
The Mathematics WikiProject is the center for mathematics-related editing on Wikipedia. Join the discussion on the project's talk page.
Project pages
Essays
Subprojects
Related projects
Things you can do
Subcategories
Algebra | Arithmetic | Analysis | Complex analysis | Applied mathematics | Calculus | Category theory | Chaos theory | Combinatorics | Dynamic 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 (books) | History of mathematics | Mathematicians | Awards | Education | Literature | Notation | Organizations | Theorems | Proofs | Unsolved problems
Topics in mathematics
General | Foundations | Number theory | Discrete mathematics |
---|---|---|---|
| |||
Algebra | Analysis | Geometry and topology | Applied mathematics |
Index of mathematics articles
ARTICLE INDEX: | 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 (0–9) |
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
Algebra | Analysis | Category theory |
Computer science |
Cryptography | Discrete mathematics |
Logic | Mathematics | Number theory |
Physics | Science | Set theory | Statistics |
In other Wikimedia projects