Euclidean algorithmIn 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 (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.
Tangent half-angle formulaIn trigonometry, tangent half-angle formulas relate the tangent of half of an angle to trigonometric functions of the entire angle. The tangent of half an angle is the stereographic projection of the circle onto a line. Among these formulas are the following: From these one can derive identities expressing the sine, cosine, and tangent as functions of tangents of half-angles: Using double-angle formulae and the Pythagorean identity gives Taking the quotient of the formulae for sine and cosine yields Combining the Pythagorean identity with the double-angle formula for the cosine, rearranging, and taking the square roots yields and which, upon division gives Alternatively, It turns out that the absolute value signs in these last two formulas may be dropped, regardless of which quadrant α is in.
Elementary functionIn mathematics, an elementary function is a function of a single variable (typically real or complex) that is defined as taking sums, products, roots and compositions of finitely many polynomial, rational, trigonometric, hyperbolic, and exponential functions, including possibly their inverse functions (e.g., arcsin, log, or x1/n). All elementary functions are continuous on their domains. Elementary functions were introduced by Joseph Liouville in a series of papers from 1833 to 1841.
Computational mathematicsComputational mathematics is an area of mathematics devoted to the interaction between mathematics and computer computation. A large part of computational mathematics consists roughly of using mathematics for allowing and improving computer computation in areas of science and engineering where mathematics are useful. This involves in particular algorithm design, computational complexity, numerical methods and computer algebra. Computational mathematics refers also to the use of computers for mathematics itself.
Elliptic boundary value problemIn mathematics, an elliptic boundary value problem is a special kind of boundary value problem which can be thought of as the stable state of an evolution problem. For example, the Dirichlet problem for the Laplacian gives the eventual distribution of heat in a room several hours after the heating is turned on. Differential equations describe a large class of natural phenomena, from the heat equation describing the evolution of heat in (for instance) a metal plate, to the Navier-Stokes equation describing the movement of fluids, including Einstein's equations describing the physical universe in a relativistic way.
Complete varietyIn mathematics, in particular in algebraic geometry, a complete algebraic variety is an algebraic variety X, such that for any variety Y the morphism is a closed map (i.e. maps closed sets onto closed sets). This can be seen as an analogue of compactness in algebraic geometry: a topological space X is compact if and only if the above projection map is closed with respect to topological products. The image of a complete variety is closed and is a complete variety. A closed subvariety of a complete variety is complete.
Erdős–Rényi modelIn the mathematical field of graph theory, the Erdős–Rényi model refers to one of two closely related models for generating random graphs or the evolution of a random network. These models are named after Hungarian mathematicians Paul Erdős and Alfréd Rényi, who introduced one of the models in 1959. Edgar Gilbert introduced the other model contemporaneously with and independently of Erdős and Rényi. In the model of Erdős and Rényi, all graphs on a fixed vertex set with a fixed number of edges are equally likely.
Partition (number theory)In number theory and combinatorics, a partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.) For example, 4 can be partitioned in five distinct ways: 4 3 + 1 2 + 2 2 + 1 + 1 1 + 1 + 1 + 1 The only partition of zero is the empty sum, having no parts.
Solvable groupIn mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminates in the trivial subgroup. Historically, the word "solvable" arose from Galois theory and the proof of the general unsolvability of quintic equation. Specifically, a polynomial equation is solvable in radicals if and only if the corresponding Galois group is solvable (note this theorem holds only in characteristic 0).
Leopold VietorisLeopold Vietoris (viːˈtoʊrɪs; viːˈtoːʀɪs; 4 June 1891 – 9 April 2002) was an Austrian mathematician, World War I veteran and supercentenarian. He was born in Radkersburg and died in Innsbruck. He was known for his contributions to topology—notably the Mayer–Vietoris sequence—and other fields of mathematics, his interest in mathematical history and for being a keen alpinist. Vietoris studied mathematics and geometry at the Vienna University of Technology. He was drafted in 1914 in World War I and was wounded in September that same year.
