Search Results for ""
611 - 620 of 1340 for Root Finding AlgorithmSearch Results
Let there be m doctors and n<=m patients, and let all mn possible combinations of examinations of patients by doctors take place. Then what is the minimum number of surgical ...
An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...
A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...
Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...
A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...
A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...
Calculus I
A base-b BBP-type formula is a convergent series formula of the type alpha=sum_(k=0)^infty(p(k))/(b^kq(k)) (1) where p(k) and q(k) are integer polynomials in k (Bailey 2000; ...
If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...
A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...
...
View search results from all Wolfram sites (23349 matches)

