Search Results for ""
381 - 390 of 13135 for Probability Generating FunctionSearch Results
If (1-z)^(a+b-c)_2F_1(2a,2b;2c;z)=sum_(n=0)^inftya_nz^n, then where (a)_n is a Pochhammer symbol and _2F_1(a,b;c;z) is a hypergeometric function.
The spherical Bessel function of the second kind, denoted y_nu(z) or n_nu(z), is defined by y_nu(z)=sqrt(pi/(2z))Y_(nu+1/2)(z), (1) where Y_nu(z) is a Bessel function of the ...
Let R(x) be the ramp function, then the Fourier transform of R(x) is given by F_x[R(x)](k) = int_(-infty)^inftye^(-2piikx)R(x)dx (1) = i/(4pi)delta^'(k)-1/(4pi^2k^2), (2) ...
For R[nu]>-1/2, J_nu(z)=(z/2)^nu2/(sqrt(pi)Gamma(nu+1/2))int_0^(pi/2)cos(zcost)sin^(2nu)tdt, where J_nu(z) is a Bessel function of the first kind, and Gamma(z) is the gamma ...
The summatory function Phi(n) of the totient function phi(n) is defined by Phi(n) = sum_(k=1)^(n)phi(k) (1) = sum_(m=1)^(n)msum_(d|m)(mu(d))/d (2) = ...
A function I_n(x) which is one of the solutions to the modified Bessel differential equation and is closely related to the Bessel function of the first kind J_n(x). The above ...
Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...
A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...
In his last letter to Hardy, Ramanujan defined 17 Jacobi theta function-like functions F(q) with |q|<1 which he called "mock theta functions" (Watson 1936ab, Ramanujan 1988, ...
The elliptic exponential function eexp_(a,b)(u) gives the value of x in the elliptic logarithm eln_(a,b)(x)=1/2int_infty^x(dt)/(sqrt(t^3+at^2+bt)) for a and b real such that ...
...


