Search Results for ""

The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...

Given a Poisson distribution with a rate of change lambda, the distribution function D(x) giving the waiting times until the hth Poisson event is D(x) = ...

Polynomials M_k(x) which form the associated Sheffer sequence for f(t)=(e^t-1)/(e^t+1) (1) and have the generating function sum_(k=0)^infty(M_k(x))/(k!)t^k=((1+t)/(1-t))^x. ...

The second-order ordinary differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)-(x^2+n^2)y=0. (1) The solutions are the modified Bessel functions of the first and second kinds, ...

The theta series of a lattice is the generating function for the number of vectors with norm n in the lattice. Theta series for a number of lattices are implemented in the ...

Special functions which arise as solutions to second order ordinary differential equations are commonly said to be "of the first kind" if they are nonsingular at the origin, ...

A class of formal series expansions in derivatives of a distribution Psi(t) which may (but need not) be the normal distribution function Phi(t)=1/(sqrt(2pi))e^(-t^2/2) (1) ...

A Mrs. Perkins's quilt is a dissection of a square of side n into a number of smaller squares. The name "Mrs. Perkins's Quilt" comes from a problem in one of Dudeney's books, ...

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

65537 is the largest known Fermat prime, and the 65537-gon is therefore a constructible polygon using compass and straightedge, as proved by Gauss. The 65537-gon has so many ...