Search Results for ""

The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...

Let a set of random variates X_1, X_2, ..., X_n have a probability function P(X_1=x_1,...,X_n=x_n)=(N!)/(product_(i=1)^(n)x_i!)product_(i=1)^ntheta_i^(x_i) (1) where x_i are ...

The divisibility test that an integer is divisible by 9 iff the sum of its digits is divisible by 9.

Let phi(t) be the characteristic function, defined as the Fourier transform of the probability density function P(x) using Fourier transform parameters a=b=1, phi(t) = ...

The exterior derivative of a function f is the one-form df=sum_(i)(partialf)/(partialx_i)dx_i (1) written in a coordinate chart (x_1,...,x_n). Thinking of a function as a ...

Let a>|b|, and write h(theta)=(acostheta+b)/(2sintheta). (1) Then define P_n(x;a,b) by the generating function f(x,w)=f(costheta,w)=sum_(n=0)^inftyP_n(x;a,b)w^n ...

A generalization of the Wilcoxon rank sum test.

A polynomial A_n(x;a) given by the associated Sheffer sequence with f(t)=te^(at), (1) given by A_n(x;a)=x(x-an)^(n-1). (2) The generating function is ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...

A formula for the Bell polynomial and Bell numbers. The general formula states that B_n(x)=e^(-x)sum_(k=0)^infty(k^n)/(k!)x^k, (1) where B_n(x) is a Bell polynomial (Roman ...