Search Results for ""

For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...

Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...

The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...

(1) for p in [0,1], where delta is the central difference and E_(2n) = G_(2n)-G_(2n+1) (2) = B_(2n)-B_(2n+1) (3) F_(2n) = G_(2n+1) (4) = B_(2n)+B_(2n+1), (5) where G_k are ...

The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...

The finite volume method is a numerical method for solving partial differential equations that calculates the values of the conserved variables averaged across the volume. ...

The quantum of a finite floating-point representation is the value of a unit in the last position of its significand. In general, the quantum is equal to the radix raised to ...

Let n>=0 and alpha_1, alpha_2, ...be the positive roots of J_n(x)=0, where J_n(z) is a Bessel function of the first kind. An expansion of a function in the interval (0,1) in ...

The tabulation of raw data obtained by dividing it into classes of some size and computing the number of data elements (or their fraction out of the total) falling within ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...