Search Results for ""

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...

Let F be the set of complex analytic functions f defined on an open region containing the closure of the unit disk D={z:|z|<1} satisfying f(0)=0 and df/dz(0)=1. For each f in ...

Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...

Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...

Landau's problems are the four "unattackable" problems mentioned by Landau in the 1912 Fifth Congress of Mathematicians in Cambridge, namely: 1. The Goldbach conjecture, 2. ...

(theta_3(z,t)theta_4(z,t))/(theta_4(2z,2t))=(theta_3(0,t)theta_4(0,t))/(theta_4(0,2t))=(theta_2(z,t)theta_1(z,t))/(theta_1(2z,2t)), where theta_i are Jacobi theta functions. ...

The dilogarithm identity Li_2(-x)=-Li_2(x/(1+x))-1/2[ln(1+x)]^2.

If xsinalpha=sin(2beta-alpha), then (1+x)int_0^alpha(dphi)/(sqrt(1-x^2sin^2phi))=2int_0^beta(dphi)/(sqrt(1-(4x)/((1+x)^2)sin^2phi)).