Search Results for ""

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 pSigma(n) for all n<p, ...

A theorem in the theory of univalent conformal mappings of families of domains on a Riemann surface, containing an inequality for the coefficients of the mapping functions, ...

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 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 ...

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 ...

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 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 ...

The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...

There are two camps of thought on the meaning of general recursive function. One camp considers general recursive functions to be equivalent to the usual recursive functions. ...