Search Results for ""

Thomae's theorem, also called Thomae's transformation, is the generalized hypergeometric function identity (1) where Gamma(z) is the gamma function, _3F_2(a,b,c;e,f;z) is a ...

The so-called explicit formula psi(x)=x-sum_(rho)(x^rho)/rho-ln(2pi)-1/2ln(1-x^(-2)) gives an explicit relation between prime numbers and Riemann zeta function zeros for x>1 ...

If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

The term domain has (at least) three different meanings in mathematics. The term domain is most commonly used to describe the set of values D for which a function (map, ...

A function H that maps an arbitrary length message M to a fixed length message digest MD is a one-way hash function if 1. It is a one-way function. 2. Given M and H(M), it is ...

The finite Fourier cosine transform of an apodization function, also known as an apparatus function. The instrument function I(k) corresponding to a given apodization ...

The infinite product identity Gamma(1+v)=2^(2v)product_(m=1)^infty[pi^(-1/2)Gamma(1/2+2^(-m)v)], where Gamma(x) is the gamma function.

Given a function f specified by parametric variables u_1, ..., u_n, a reparameterization f^^ of f over domain U is a change of variables u_i in U->v_i->V via a function phi ...

The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...