Search Results for ""

An inequality which implies the correctness of the Robertson conjecture (Milin 1964). de Branges (1985) proved this conjecture, which led to the proof of the full Bieberbach ...

A map projection given by the following transformation, x = lambda-lambda_0 (1) y = 5/4ln[tan(1/4pi+2/5phi)] (2) = 5/4sinh^(-1)[tan(4/5phi)]. (3) Here, x and y are the plane ...

Several cylindrical equidistant projections were devised by R. Miller. Miller's projections have standard parallels of phi_1=37 degrees30^' (giving minimal overall scale ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

In French and German usage, one milliard equals 10^9=1000000000. American usage does not have a number called the milliard, instead using the term billion to denote 10^9. ...

det(i+j+mu; 2i-j)_(i,j=0)^(n-1)=2^(-n)product_(k=0)^(n-1)Delta_(2k)(2mu), where mu is an indeterminate, Delta_0(mu)=2, ...

Mills' constant can be defined as the least theta such that f_n=|_theta^(3^n)_| is prime for all positive integers n (Caldwell and Cheng 2005). The first few f_n for n=1, 2, ...

A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...

The unknotting number for a torus knot (p,q) is (p-1)(q-1)/2. This 40-year-old conjecture was proved (Adams 1994) by Kronheimer and Mrowka (1993, 1995).

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...