Search Results for ""

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...

A general quintic equation a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0=0 (1) can be reduced to one of the form y^5+b_2y^2+b_1y+b_0=0, (2) called the principal quintic form. Vieta's ...

The study of angles and of the angular relationships of planar and three-dimensional figures is known as trigonometry. The trigonometric functions (also called the circular ...

Clausen's integral, sometimes called the log sine integral (Borwein and Bailey 2003, p. 88) is the n=2 case of the S_2 Clausen function Cl_2(theta) = ...

A product involving an infinite number of terms. Such products can converge. In fact, for positive a_n, the product product_(n=1)^(infty)a_n converges to a nonzero number iff ...

A factor is a portion of a quantity, usually an integer or polynomial that, when multiplied by other factors, gives the entire quantity. The determination of factors is ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...