Search Results for ""

An integer d is a fundamental discriminant if it is not equal to 1, not divisible by any square of any odd prime, and satisfies d=1 (mod 4) or d=8,12 (mod 16). The function ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

The group Gamma of all Möbius transformations of the form tau^'=(atau+b)/(ctau+d), (1) where a, b, c, and d are integers with ad-bc=1. The group can be represented by the 2×2 ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

Let E be an elliptic curve defined over the field of rationals Q(sqrt(-d)) having equation y^2=x^3+ax+b with a and b integers. Let P be a point on E with integer coordinates ...

Hackenbush is a game in combinatorial game theory in which player Left can delete any bLue edge, player Right can delete any Red edge, and either player can delete Green ...

A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...

Following Ramanujan (1913-1914), write product_(k=1,3,5,...)^infty(1+e^(-kpisqrt(n)))=2^(1/4)e^(-pisqrt(n)/24)G_n (1) ...

An equation for a lattice sum b_3(1) (Borwein and Bailey 2003, p. 26) b_3(1) = sum^'_(i,j,k=-infty)^infty((-1)^(i+j+k))/(sqrt(i^2+j^2+k^2)) (1) = ...

The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...