Search Results for ""
211 - 220 of 3209 for Subset sum problemSearch Results
_2phi_1(a,q^(-n);c;q,q)=(a^n(c/a,q)_n)/((a;q)_n), where _2phi_1(a,b;c;q,z) is a q-hypergeometric function.
Let S be partitioned into r×s disjoint sets E_i and F_j where the general subset is denoted E_i intersection F_j. Then the marginal probability of E_i is ...
A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).
Let the divisor function d(n) be the number of divisors of n (including n itself). For a prime p, d(p)=2. In general, sum_(k=1)^nd(k)=nlnn+(2gamma-1)n+O(n^theta), where gamma ...
An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...
Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...
Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.
Schur (1916) proved that no matter how the set of positive integers less than or equal to |_n!e_| (where |_x_| is the floor function) is partitioned into n classes, one class ...
The Cartesian product of a finite or infinite set of modules over a ring with only finitely many nonzero entries in each sequence.
Let t be a nonnegative integer and let x_1, ..., x_t be nonzero elements of Z_p which are not necessarily distinct. Then the number of elements of Z_p that can be written as ...
...
View search results from all Wolfram sites (180219 matches)

