Search Results for ""

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...

The algebraic identity (sum_(i=1)^na_ic_i)(sum_(i=1)^nb_id_i)-(sum_(i=1)^na_id_i)(sum_(i=1)^nb_ic_i) =sum_(1<=i<j<=n)(a_ib_j-a_jb_i)(c_id_j-c_jd_i). (1) Letting c_i=a_i and ...

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

Binet's first formula for the log gamma function lnGamma(z), where Gamma(z) is a gamma function, is given by for R[z]>0 (Erdélyi et al. 1981, p. 21; Whittaker and Watson ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...

The term "biquadratic equation" is sometimes used to as a synonym for quartic equation (Beyer 1987b, p. 34), but perhaps more commonly (e.g., Hazewinkel 1988; Gellert et al. ...

Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...

A quaternion with complex coefficients. The algebra of biquaternions is isomorphic to a full matrix ring over the complex number field (van der Waerden 1985).

Let T be an ergodic endomorphism of the probability space X and let f:X->R be a real-valued measurable function. Then for almost every x in X, we have 1/nsum_(j=1)^nf ...