Search Results for ""

The probability P(a,n) that n random arcs of angular size a cover the circumference of a circle completely (for a circle with unit circumference) is ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

A differential-algebraic equation (DAE) is a type of differential equation in which the derivatives are not (in general) expressed explicitly, and typically derivatives of ...

There are (at least) two graphs associated with Ellingham and Horton. These graphs on 54 and 78 nodes respectively, illustrated above, are examples of 3-connected bicubic ...

An ellipsoid can be specified parametrically by x = acosusinv (1) y = bsinusinv (2) z = ccosv. (3) The geodesic parameters are then P = sin^2v(b^2cos^2u+a^2sin^2u) (4) Q = ...

Bezdek and Kuperberg (1991) have constructed packings of identical ellipsoids of densities arbitrarily close to ((24sqrt(2)-6sqrt(3)-2pi)pi)/(72)=0.753355... (OEIS A093824), ...

Euler conjectured that there do not exist Euler squares of order n=4k+2 for k=1, 2, .... In fact, MacNeish (1921-1922) published a purported proof of this conjecture (Bruck ...

In 1638, Fermat proposed that every positive integer is a sum of at most three triangular numbers, four square numbers, five pentagonal numbers, and n n-polygonal numbers. ...

Let two players each have a finite number of pennies (say, n_1 for player one and n_2 for player two). Now, flip one of the pennies (from either player), with each player ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...