Search Results for ""

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...

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

Elliptic alpha functions relate the complete elliptic integrals of the first K(k_r) and second kinds E(k_r) at elliptic integral singular values k_r according to alpha(r) = ...

The Hankel functions of the first kind are defined as H_n^((1))(z)=J_n(z)+iY_n(z), (1) where J_n(z) is a Bessel function of the first kind and Y_n(z) is a Bessel function of ...

A generalization of the complete beta function defined by B(z;a,b)=int_0^zu^(a-1)(1-u)^(b-1)du, (1) sometimes also denoted B_z(a,b). The so-called Chebyshev integral is given ...

Given the left factorial function Sigma(n)=sum_(k=1)^nk!, SK(p) for p prime is the smallest integer n such that p|1+Sigma(n-1). The first few known values of SK(p) are 2, 4, ...

Johnson solid J_(19).

Johnson solid J_(45).

The mean square displacement (MSD) of a set of N displacements x_n is given by <|x|^2>=sum_(k=1)^N|x_k|^2. It arises particularly in Brownian motion and random walk problems. ...