Search Results for ""
301 - 310 of 750 for Nth RootSearch Results
![](/common/images/search/spacer.gif)
The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...
A centered triangular number is a centered polygonal number consisting of a central dot with three dots around it, and then additional dots in the gaps between adjacent dots. ...
The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...
The nth central fibonomial coefficient is defined as [2n; n]_F = product_(k=1)^(n)(F_(n+k))/(F_k) (1) = ...
The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...
Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...
A connex is a geometric form introduced by Clebsch (1872) that included as special cases the curve considered as a point locus and the curve considered as a line envelope ...
The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...
The discrete Fourier transform of length N (where N is even) can be rewritten as the sum of two discrete Fourier transforms, each of length N/2. One is formed from the ...
The number d(n) of monotone Boolean functions of n variables (equivalent to one more than the number of antichains on the n-set {1,2,...,n}) is called the nth Dedkind number. ...
![](/common/images/search/spacer.gif)
...