TOPICS
Search

Search Results for ""


201 - 210 of 13134 for binomial theorySearch Results
The maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...
An extension field of a field F that is not algebraic over F, i.e., an extension field that has at least one element that is transcendental over F. For example, the field of ...
A witness is a number which, as a result of its number theoretic properties, guarantees either the compositeness or primality of a number n. Witnesses are most commonly used ...
For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ij):M_i->M_j i<=j be an R-module homomorphism. Call (M_i,sigma_(ij)) a direct system over I ...
A polynomial that represents integers for all integer values of the variables. An integer polynomial is a special case of such a polynomial. In general, every integer ...
A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...
A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...
A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...
The Stiefel manifold of orthonormal k-frames in R^n is the collection of vectors (v_1, ..., v_k) where v_i is in R^n for all i, and the k-tuple (v_1, ..., v_k) is ...
Apéry's numbers are defined by A_n = sum_(k=0)^(n)(n; k)^2(n+k; k)^2 (1) = sum_(k=0)^(n)([(n+k)!]^2)/((k!)^4[(n-k)!]^2) (2) = _4F_3(-n,-n,n+1,n+1;1,1,1;1), (3) where (n; k) ...
1 ... 18|19|20|21|22|23|24 ... 1314 Previous Next

...