Search Results for ""
1521 - 1530 of 3209 for Subset sum problemSearch Results
A^*(x)=sum_(lambda_n<=x)^'a_n=1/(2pii)int_(c-iinfty)^(c+iinfty)f(s)(e^(sx))/sds, where f(s)=suma_ne^(-lambda_ns).
The addition of two quantities, i.e., a plus b. The operation is denoted a+b, and the symbol + is called the plus sign. Floating-point addition is sometimes denoted direct ...
Let chi be a nonprincipal number theoretic character over Z/Zn. Then for any integer h, |sum_(x=1)^hchi(x)|<=2sqrt(n)lnn.
For a polynomial P=sum_(k=0)^na_kz^k, (1) several classes of norms are commonly defined. The l_p-norm is defined as ||P||_p=(sum_(k=0)^n|a_k|^p)^(1/p) (2) for p>=1, giving ...
The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.
A^n+B^n=sum_(j=0)^(|_n/2_|)(-1)^jn/(n-j)(n-j; j)(AB)^j(A+B)^(n-2j), where |_x_| is the floor function and (n; k) is a binomial coefficient.
Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...
x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).
sum_(y=0)^m(-1)^(m-y)q^((m-y; 2))[m; y]_q(1-wq^m)/(q-wq^y) ×(1-wq^y)^m(-(1-z)/(1-wq^y);q)_y=(1-z)^mq^((m; 2)), where [n; y]_q is a q-binomial coefficient.
A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...
...
View search results from all Wolfram sites (180219 matches)

