TOPICS
Search

Search Results for ""


1231 - 1240 of 1340 for Root Finding AlgorithmSearch Results
The 5.1.2 fifth-order Diophantine equation A^5=B^5+C^5 (1) is a special case of Fermat's last theorem with n=5, and so has no solution. improving on the results on Lander et ...
In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...
In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...
In 1611, Kepler proposed that close packing (either cubic or hexagonal close packing, both of which have maximum densities of pi/(3sqrt(2)) approx 74.048%) is the densest ...
Machin-like formulas have the form mcot^(-1)u+ncot^(-1)v=1/4kpi, (1) where u, v, and k are positive integers and m and n are nonnegative integers. Some such formulas can be ...
A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...
A parabola (plural "parabolas"; Gray 1997, p. 45) is the set of all points in the plane equidistant from a given line L (the conic section directrix) and a given point F not ...
The small stellated dodecahedron is the Kepler-Poinsot polyhedra whose dual polyhedron is the great dodecahedron. It is also uniform polyhedron with Maeder index 34 (Maeder ...
A sphere is defined as the set of all points in three-dimensional Euclidean space R^3 that are located at a distance r (the "radius") from a given point (the "center"). Twice ...
Define the packing density eta of a packing of spheres to be the fraction of a volume filled by the spheres. In three dimensions, there are three periodic packings for ...
1 ... 121|122|123|124|125|126|127 ... 134 Previous Next

...