TOPICS
Search

Search Results for ""


851 - 860 of 2617 for Prime Generating PolynomialSearch Results
A polygonal number of the form n(3n-1)/2. The first few are 1, 5, 12, 22, 35, 51, 70, ... (OEIS A000326). The generating function for the pentagonal numbers is ...
A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...
A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...
Any ideal of a ring which is strictly smaller than the whole ring. For example, 2Z is a proper ideal of the ring of integers Z, since 1 not in 2Z. The ideal <X> of the ...
Special functions which arise as solutions to second order ordinary differential equations are commonly said to be "of the first kind" if they are nonsingular at the origin, ...
There exist points A^', B^', and C^' on segments BC, CA, and AB of a triangle, respectively, such that A^'C+CB^'=B^'A+AC^'=C^'B+BA^' (1) and the lines AA^', BB^', CC^' ...
There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...
A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...
The transformation of a sequence a_1, a_2, ... with a_n=sum_(d|n)b_d (1) into the sequence b_1, b_2, ... via the Möbius inversion formula, b_n=sum_(d|n)mu(n/d)a_d. (2) The ...
Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...
1 ... 83|84|85|86|87|88|89 ... 262 Previous Next

...