Search Results for ""
2621 - 2630 of 3358 for Ackermann FunctionSearch Results
![](/common/images/search/spacer.gif)
In general, the word "complement" refers to that subset F^' of some set S which excludes a given subset F. Taking F and its complement F^' together then gives the whole of ...
A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...
Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...
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 ...
The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...
A fiber bundle (also called simply a bundle) with fiber F is a map f:E->B where E is called the total space of the fiber bundle and B the base space of the fiber bundle. The ...
The fundamental theorem(s) of calculus relate derivatives and integrals with one another. These relationships are both important theoretical achievements and pactical tools ...
A generalized continued fraction is an expression of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))), (1) where the partial numerators a_1,a_2,... and partial ...
The recursive sequence defined by the recurrence relation a(n)=a(a(n-1))+a(n-a(n-1)) (1) with a(1)=a(2)=1. The first few values are 1, 1, 2, 2, 3, 4, 4, 4, 5, 6, ... (OEIS ...
Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...
![](/common/images/search/spacer.gif)
...