TOPICS
Search

Search Results for ""


1231 - 1240 of 3238 for Goedels Second Incompleteness TheoremSearch Results
The Heawood four-color graph is the 25-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's ...
Given any straight line and a point not on it, there "exists one and only one straight line which passes" through that point and never intersects the first line, no matter ...
The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...
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 ...
Draw antiparallels through the symmedian point K. The points where these lines intersect the sides then lie on a circle, known as the cosine circle (or sometimes the second ...
There are a number of attractive polyhedron compounds of two cubes. The first (left figures) is obtained by allowing two cubes to share opposite polyhedron vertices then ...
The Neuberg cubic Z(X_(30)) of a triangle DeltaABC is the locus of all points P whose reflections in the sidelines BC, CA, and ABform a triangle perspective to DeltaABC. It ...
Sphere tetrahedron picking is the selection of quadruples of of points corresponding to vertices of a tetrahedron with vertices on the surface of a sphere. n random ...
A differential equation or system of ordinary differential equations is said to be autonomous if it does not explicitly contain the independent variable (usually denoted t). ...
Ballantine's series is the series for pi given by pi=864sum_(n=0)^infty((n!)^24^n)/((2n+1)!325^(n+1)) +1824sum_(n=0)^infty((n!)^24^n)/((2n+1)!3250^(n+1))-20cot^(-1)239 ...
1 ... 121|122|123|124|125|126|127 ... 324 Previous Next

...