TOPICS
Search

Search Results for ""


1401 - 1410 of 3209 for Subset sum problemSearch Results
Approximates the possible values of y in terms of x if sum_(i,j=0)^na_(ij)x^iy^j=0.
A 1-form omega=sum_(i=1)^na_i(x)dx_i such that omega=0.
Let a general theta function be defined as T(x,q)=sum_(n=-infty)^inftyx^nq^(n^2), then
For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.
An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...
A polygonal number of the form n(3n-1)/2. The first few are 1, 5, 12, 22, 35, 51, 70, ... (OEIS A000326). The generating function for the pentagonal numbers is ...
Analysis
An ellipse is a curve that is the locus of all points in the plane the sum of whose distances r_1 and r_2 from two fixed points F_1 and F_2 (the foci) separated by a distance ...
A bicubic spline is a special case of bicubic interpolation which uses an interpolation function of the form y(x_1,x_2) = sum_(i=1)^(4)sum_(j=1)^(4)c_(ij)t^(i-1)u^(j-1) (1) ...
product_(k=1)^(n)(1+yq^k) = sum_(m=0)^(n)y^mq^(m(m+1)/2)[n; m]_q (1) = sum_(m=0)^(n)y^mq^(m(m+1)/2)((q)_n)/((q)_m(q)_(n-m)), (2) where [n; m]_q is a q-binomial coefficient.
1 ... 138|139|140|141|142|143|144 ... 321 Previous Next

...