TOPICS
Search

Search Results for ""


871 - 880 of 4429 for Sum of squares functionSearch Results
_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...
The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...
An even perfect number is perfect number that is even, i.e., an even number n whose sum of divisors (including n itself) equals n. All known perfect numbers are even, and ...
The ratio X_1/X_2 of uniform variates X_1 and X_2 on the interval [0,1] can be found directly as P_(X_1/X_2)(u) = int_0^1int_0^1delta((x_1)/(x_2)-u)dx_1dx_2 (1) = ...
The limit of a lower sum, when it exists, as the mesh size approaches 0.
The limit of an upper sum, when it exists, as the mesh size approaches 0.
A series involving three sums. Examples of convergent triple series include sum_(i=1)^(infty)sum_(j=1)^(infty)sum_(k=1)^(infty)1/((ijk)^2) = 1/(216)pi^6 (1) ...
A number n is called an Egyptian number if it is the sum of the denominators in some unit fraction representation of a positive whole number not consisting entirely of 1s. ...
On an algebraic curve, the sum of the number of coincidences at a noncuspidal point C is the sum of the orders of the infinitesimal distances from a nearby point P to the ...
In a 1631 edition of Academiae Algebrae, J. Faulhaber published the general formula for the power sum of the first n positive integers, sum_(k=1)^(n)k^p = H_(n,-p) (1) = ...
1 ... 85|86|87|88|89|90|91 ... 443 Previous Next

...