TOPICS
Search

Search Results for ""


1061 - 1070 of 3209 for Subset sum problemSearch Results
Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...
The outer Soddy circle is the solution to the four coins problem. It has circle function l=((-a+b+c)^2[f(a,b,c)+16g(a,b,c)rs])/(4bc[(a^2+b^2+c^2)-2(ab+bc+ca)+8rs]^4), (1) ...
An n-step Fibonacci sequence {F_k^((n))}_(k=1)^infty is defined by letting F_k^((n))=0 for k<=0, F_1^((n))=F_2^((n))=1, and other terms according to the linear recurrence ...
Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...
nu_((r))=sum_(x)x^((r))f(x), where x^((r))=x(x-1)...(x-r+1).
sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).
A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...
If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...
An m×n matrix which gives the possible outcome of a two-person zero-sum game when player A has m possible moves and player B n moves. The analysis of the matrix in order to ...
An algebraic equation in n variables is an polynomial equation of the form f(x_1,x_2,...,x_n)=sum_(e_1,...,e_n)c_(e_1,e_2,...,e_n)x_1^(e_1)x_2^(e_2)...x_n^(e_n)=0, where the ...
1 ... 104|105|106|107|108|109|110 ... 321 Previous Next

...