Concept
Factorial
Related concepts (52)
Eulerian number
In combinatorics, the Eulerian number is the number of permutations of the numbers 1 to in which exactly elements are greater than the previous element (permutations with "ascents"). Leonhard Euler investigated them and associated polynomials in his 1755 book Institutiones calculi differentialis. Other notations for are and . The Eulerian polynomials are defined by the exponential generating function The Eulerian numbers may be defined as the coefficients of the Eulerian polynomials: An explicit formula for is For fixed there is a single permutation which has 0 ascents: .
Brute-force search
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement. A brute-force algorithm that finds the divisors of a natural number n would enumerate all integers from 1 to n, and check whether each of them divides n without remainder.
Wallis product
In mathematics, the Wallis product for pi, published in 1656 by John Wallis, states that Wallis derived this infinite product using interpolation, though his method is not regarded as rigorous. A modern derivation can be found by examining for even and odd values of , and noting that for large , increasing by 1 results in a change that becomes ever smaller as increases. Let (This is a form of Wallis' integrals.) Integrate by parts: Now, we make two variable substitutions for convenience to obtain: We obtain values for and for later use.
Logarithmically convex function
In mathematics, a function f is logarithmically convex or superconvex if , the composition of the logarithm with f, is itself a convex function. Let X be a convex subset of a real vector space, and let f : X → R be a function taking non-negative values. Then f is: Logarithmically convex if is convex, and Strictly logarithmically convex if is strictly convex. Here we interpret as .
Līlāvatī
Līlāvatī is Indian mathematician Bhāskara II's treatise on mathematics, written in 1150 AD. It is the first volume of his main work, the Siddhānta Shiromani, alongside the Bijaganita, the Grahaganita and the Golādhyāya. His book on arithmetic is the source of interesting legends that assert that it was written for his daughter, Lilavati. Lilavati was Bhaskara II's daughter. Bhaskara II studied Lilavati's horoscope and predicted that she would remain both childless and unmarried.
Arithmetic progression
An arithmetic progression or arithmetic sequence ( ()) is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence. The constant difference is called common difference of that arithmetic progression. For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression with a common difference of 2.
Natural density
In number theory, natural density (also referred to as asymptotic density or arithmetic density) is one method to measure how "large" a subset of the set of natural numbers is. It relies chiefly on the probability of encountering members of the desired subset when combing through the interval [1, ] as n grows large. Intuitively, it is thought that there are more positive integers than perfect squares, since every perfect square is already positive, and many other positive integers exist besides.
Volume of an n-ball
In geometry, a ball is a region in a space comprising all points within a fixed distance, called the radius, from a given point; that is, it is the region enclosed by a sphere or hypersphere. An n-ball is a ball in an n-dimensional Euclidean space. The volume of a n-ball is the Lebesgue measure of this ball, which generalizes to any dimension the usual volume of a ball in 3-dimensional space. The volume of a n-ball of radius R is where is the volume of the unit n-ball, the n-ball of radius 1.
Wilson's theorem
In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is (using the notations of modular arithmetic), the factorial satisfies exactly when n is a prime number. In other words, any number n is a prime number if, and only if, (n − 1)! + 1 is divisible by n. This theorem was stated by Ibn al-Haytham (c. 1000 AD), and, in the 18th century, by the English mathematician John Wilson.
Newton's identities
In mathematics, Newton's identities, also known as the Girard–Newton formulae, give relations between two types of symmetric polynomials, namely between power sums and elementary symmetric polynomials. Evaluated at the roots of a monic polynomial P in one variable, they allow expressing the sums of the k-th powers of all roots of P (counted with their multiplicity) in terms of the coefficients of P, without actually finding those roots. These identities were found by Isaac Newton around 1666, apparently in ignorance of earlier work (1629) by Albert Girard.