Search Results for ""

If lim_(z->z_0)(f(z)-f(z_0))/(z-z_0) is the same for all paths in the complex plane, then f(z) is said to be monogenic at z_0. Monogenic therefore essentially means having a ...

int_0^z(t^mu)/(1+t)dt=z/(mu+1+((mu+1)^2z)/((mu+2)-(mu+1)z+((mu+2)^2z)/((mu+3)-(mu+2)z+...))) for mu>-1 and -1<z<=1 (Perron 1954-1957, p. 18; Borwein et al. 2004, p. 35).

Wilker's inequalities state that 2+(16)/(pi^4)x^3tanx<(sin^2x)/(x^2)+(tanx)/x<2+2/(45)x^3tanx for 0<x<pi/2, where the constants 2/45 and 16/pi^4 are the best possible ...

The Bailey mod 9 identities are a set of three Rogers-Ramanujan-like identities appearing as equations (1.6), (1.8), and (1.7) on p. 422 of Bailey (1947) given by A(q) = ...

product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...

The Rogers-Selberg identities are a set of three analytic q-series identities of Rogers-Ramanujan-type appearing as equation 33, 32, and 31 in Slater (1952), A(q) = ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

Eternity is a puzzle devised by Christopher Monckton and consisting of 209 pieces, each of which is a 12-polydrafter (i.e., a compound of 30-60-90 triangles). The puzzle was ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...