TOPICS
Search

Search Results for ""


551 - 560 of 4429 for Sum of squares functionSearch Results
A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...
The sum of reciprocal multifactorials can be given in closed form by the beautiful formula m(n) = sum_(n=0)^(infty)1/(n!...!_()_(k)) (1) = ...
If f(x)=f_0+f_1x+f_2x^2+...+f_nx^n+..., (1) then S(n,j)=f_jx^j+f_(j+n)x^(j+n)+f_(j+2n)x^(j+2n)+... (2) is given by S(n,j)=1/nsum_(t=0)^(n-1)w^(-jt)f(w^tx), (3) where ...
A shorthand name for a series with the variable k taken to a negative exponent, e.g., sum_(k=1)^(infty)k^(-p), where p>1. p-series are given in closed form by the Riemann ...
The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...
The Lebesgue integral is defined in terms of upper and lower bounds using the Lebesgue measure of a set. It uses a Lebesgue sum S_n=sum_(i)eta_imu(E_i) where eta_i is the ...
The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...
The transform inverting the sequence g(n)=sum_(d|n)f(d) (1) into f(n)=sum_(d|n)mu(d)g(n/d), (2) where the sums are over all possible integers d that divide n and mu(d) is the ...
An n×n magic square for which every pair of numbers symmetrically opposite the center sum to n^2+1. The Lo Shu is associative but not panmagic. The numbers of associative ...
Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...
1 ... 53|54|55|56|57|58|59 ... 443 Previous Next

...