Search Results for ""
471 - 480 of 3209 for Subset sum problemSearch Results
The differential forms on C^n decompose into forms of type (p,q), sometimes called (p,q)-forms. For example, on C, the exterior algebra decomposes into four types: ^ C = ^ ^0 ...
Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...
The sum of the aliquot divisors of n, given by s(n)=sigma(n)-n, where sigma(n) is the divisor function. The first few values are 0, 1, 1, 3, 1, 6, 1, 7, 4, 8, 1, 16, ... ...
The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...
An edge-induced subgraph is a subset of the edges of a graph G together with any vertices that are their endpoints. The subgraph induced by a set of edges can be computed in ...
A subset E of a topological space S is said to be meager if E is of first category in S, i.e., if E can be written as the countable union of subsets which are nowhere dense ...
Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...
The value for zeta(2)=sum_(k=1)^infty1/(k^2) (1) can be found using a number of different techniques (Apostol 1983, Choe 1987, Giesy 1972, Holme 1970, Kimble 1987, Knopp and ...
The series sum_(k=1)^infty1/k (1) is called the harmonic series. It can be shown to diverge using the integral test by comparison with the function 1/x. The divergence, ...
Any sum of a selection of Pi_ks, where Pi_k denotes a k-D polytope.
...
View search results from all Wolfram sites (180219 matches)

