Search Results for ""

Bessel's correction is the factor (N-1)/N in the relationship between the variance sigma and the expectation values of the sample variance, <s^2>=(N-1)/Nsigma^2, (1) where ...

Let G be Gauss's constant and M=1/G be its multiplicative inverse. Then M/sqrt(2)=0.8472130... (OEIS A097057) is sometimes known as the ubiquitous constant (Spanier and ...

A reciprocity theorem for the case n=3 solved by Gauss using "integers" of the form a+brho, when rho is a root of x^2+x+1=0 (i.e., rho equals -(-1)^(1/3) or (-1)^(2/3)) and ...

As Gauss showed in 1812, the hyperbolic tangent can be written using a continued fraction as tanhx=x/(1+(x^2)/(3+(x^2)/(5+...))) (Wall 1948, p. 349; Olds 1963, p. 138).

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

(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 element in the diagonal of a matrix by which other elements are divided in an algorithm such as Gauss-Jordan elimination is called the pivot element. Partial pivoting is ...

Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...

If there exists a rational integer x such that, when n, p, and q are positive integers, x^n=q (mod p), then q is the n-adic residue of p, i.e., q is an n-adic residue of p ...