Search Results for ""

The vercosine, written vercos(z) and also known as the "versed cosine," is a little-used trigonometric function defined by vercos(z) = 2cos^2(1/2z) (1) = 1+cosz, (2) where ...

The Thue-Morse constant, also called the parity constant, is given by the concatenated digits of the Thue-Morse sequence P=0.0110100110010110100101100..._2 (1) (OEIS A010060) ...

For every dimension n>0, the orthogonal group O(n) is the group of n×n orthogonal matrices. These matrices form a group because they are closed under multiplication and ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...

Define S_n(x) = sum_(k=1)^(infty)(sin(kx))/(k^n) (1) C_n(x) = sum_(k=1)^(infty)(cos(kx))/(k^n), (2) then the Clausen functions are defined by ...

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

Pick any two relatively prime integers h and k, then the circle C(h,k) of radius 1/(2k^2) centered at (h/k,+/-1/(2k^2)) is known as a Ford circle. No matter what and how many ...

The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...

Jackson's theorem is a statement about the error E_n(f) of the best uniform approximation to a real function f(x) on [-1,1] by real polynomials of degree at most n. Let f(x) ...