History of mathematics presented through famous problems, with some exercises and their solutions. Done in conjunction with the Math Forum, the home of Ask Dr. Math.

The Four Color Theorem This page gives a brief summary of a new proof of the Four Color Theorem and a four-coloring algorithm found by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas. Table of Contents: History. Why a new proof Outline of the proof. Main features of our proof. Configurations. Discharging rules. Pointers. A quadratic algorithm. Discussion. References. History.

The Mathematical Problems of David Hilbert About Hilbert's address and his 23 mathematical problems Hilbert's address of 1900 to the International Congress of Mathematicians in Paris is perhaps the most influential speech ever given to mathematicians, given by a mathematician, or given about mathematics. In it, Hilbert outlined 23 major mathematical problems to be studied in the coming century.

Stanford Encyclopedia of Philosophy A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z Russell's Paradox Russell's paradox is the most famous of the logical or set-theoretical paradoxes. The paradox arises within naive set theory by considering the set of all sets that are not members of themselves. Such a set appears to be a member of itself if ...

The four colour theorem Geometry and topology index History Topics Index The Four Colour Conjecture first seems to have been made by Francis Guthrie. He was a student at University College London where he studied under De Morgan. After graduating from London he studied law but by this time his brother Frederick Guthrie had become a student of De Morgan. Francis Guthrie showed his brother some ...

The ultimate Knight's Tour page of Links ...

A fast unique solution for the travelling salesman problem using genetic algorithms.

Information about, an analysis of, and simulation of the Monty Hall Problem.