Search Results for ""
1001 - 1010 of 2617 for Prime Generating PolynomialSearch Results
The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.
A figurate number of the form, CCub_n=n^3+(n-1)^3=(2n-1)(n^2-n+1). The first few are 1, 9, 35, 91, 189, 341, ... (OEIS A005898). The generating function for the centered cube ...
Consider a set of points X_i on an attractor, then the correlation integral is C(l)=lim_(N->infty)1/(N^2)f, where f is the number of pairs (i,j) whose distance |X_i-X_j|<l. ...
A figurate number of the form 4n^2-3n. The first few are 1, 10, 27, 52, 85, ... (OEIS A001107). The generating function giving the decagonal numbers is ...
An integer used to generate a digitaddition. A number can have more than one generator. If a number has no generator, it is called a self number.
For R[a+b-c-d]<-1 and a and b not integers,
For any integers a_i with 1<=a_1<a_2<...<a_k<=n, the proportion of permutations in the symmetric group S_n whose cyclic decompositions contain no cycles of lengths a_1, a_2, ...
An even perfect number is perfect number that is even, i.e., an even number n whose sum of divisors (including n itself) equals n. All known perfect numbers are even, and ...
An (n-1)-dimensional face of an n-dimensional polytope. A procedure for generating facets is known as faceting.
The first isodynamic point S has triangle center function alpha_(15)=sin(A+1/3pi) and is Kimberling center X_(15) (Kimberling 1998, p. 68).
...
View search results from all Wolfram sites (24574 matches)

