Search Results for ""

A rotor is a convex figure that can be rotated inside a polygon (or polyhedron) while always touching every side (or face). The least area rotor in a square is the Reuleaux ...

The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...

Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...

A theorem, also known as Bachet's conjecture, which Bachet inferred from a lack of a necessary condition being stated by Diophantus. It states that every positive integer can ...

A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...

There are four completely different definitions of the so-called Apollonius circles: 1. The set of all points whose distances from two fixed points are in a constant ratio ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

The Euler-Lagrange differential equation is the fundamental equation of calculus of variations. It states that if J is defined by an integral of the form J=intf(t,y,y^.)dt, ...

A method which can be used to solve the initial value problem for certain classes of nonlinear partial differential equations. The method reduces the initial value problem to ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...