Search Results for ""

A function f:{0,1}^(l(n))×{0,1}^n->{0,1}^(m(n)) is a trapdoor one-way hash function if f is a trapdoor one-way function and is also a one-way hash function, i.e., if, ...

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...

The log-likelihood function F(theta) is defined to be the natural logarithm of the likelihood function L(theta). More precisely, F(theta)=lnL(theta), and so in particular, ...

Define S_n(x) = sum_(k=1)^(infty)(sin(kx))/(k^n) (1) C_n(x) = sum_(k=1)^(infty)(cos(kx))/(k^n), (2) then the Clausen functions are defined by ...

The probability density function (PDF) P(x) of a continuous distribution is defined as the derivative of the (cumulative) distribution function D(x), D^'(x) = ...

The Dedekind psi-function is defined by the divisor product psi(n)=nproduct_(p|n)(1+1/p), (1) where the product is over the distinct prime factors of n, with the special case ...

Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...

Given a smooth function f:R^n->R^n, if the Jacobian is invertible at 0, then there is a neighborhood U containing 0 such that f:U->f(U) is a diffeomorphism. That is, there is ...

A function giving the distribution of the interpoint distances of a curve. It is defined by p(r)=1/Nsum_(ij)delta_(r_(ij)=r).

The multiplicative suborder of a number a (mod n) is the least exponent e>0 such that a^e=+/-1 (mod n), or zero if no such e exists. An e always exists if GCD(a,n)=1 and n>1. ...