TOPICS
Search

Search Results for ""


1261 - 1270 of 2487 for Prime SumsSearch Results
Let phi(n) be any function, say analytic or integrable. Then int_0^inftyx^(s-1)sum_(k=0)^infty(-1)^kx^kphi(k)dx=(piphi(-s))/(sin(spi)) (1) and ...
Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...
The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...
The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...
An analytic function f(z) whose Laurent series is given by f(z)=sum_(n=-infty)^inftya_n(z-z_0)^n, (1) can be integrated term by term using a closed contour gamma encircling ...
For |q|<1, the Rogers-Ramanujan identities are given by (Hardy 1999, pp. 13 and 90), sum_(n=0)^(infty)(q^(n^2))/((q)_n) = 1/(product_(n=1)^(infty)(1-q^(5n-4))(1-q^(5n-1))) ...
A series expansion is a representation of a particular function as a sum of powers in one of its variables, or by a sum of powers of another (usually elementary) function ...
Let the sum of squares function r_k(n) denote the number of representations of n by k squares, then the summatory function of r_2(k)/k has the asymptotic expansion ...
Let a simple graph G have n vertices, chromatic polynomial P(x), and chromatic number chi. Then P(G) can be written as P(G)=sum_(i=0)^ha_i·(x)_(p-i), where h=n-chi and (x)_k ...
The sigmoid function, also called the sigmoidal curve (von Seggern 2007, p. 148) or logistic function, is the function y=1/(1+e^(-x)). (1) It has derivative (dy)/(dx) = ...
1 ... 124|125|126|127|128|129|130 ... 249 Previous Next

...