Search Results for ""

A Fermat prime is a Fermat number F_n=2^(2^n)+1 that is prime. Fermat primes are therefore near-square primes. Fermat conjectured in 1650 that every Fermat number is prime ...

Euler (1772ab) conjectured that there are no positive integer solutions to the quartic Diophantine equation A^4=B^4+C^4+D^4. This conjecture was disproved by Elkies (1988), ...

The geometry resulting from the application of the inversion operation. It can be especially powerful for solving apparently difficult problems such as Steiner's porism and ...

A 15-sided polygon, sometimes also called the pentakaidecagon. For a regular pentadecagon with side length 1, the inradius r, circumradius R, and area A are r = ...

A 30-sided polygon. The regular triacontagon with side length 1 has inradius r, circumradius R, and area A given by r = 1/4(sqrt(15)+3sqrt(3)+sqrt(2)sqrt(25+11sqrt(5))) (1) R ...

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 ...

A 24-sided polygon. The regular icositetragon is constructible. For side length 1, the inradius r, circumradius R, and area A are given by r = 1/2(2+sqrt(2)+sqrt(3)+sqrt(6)) ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...