About the Project

1995: Proof of Fermat's last theorem – Given an integer n2, there are no three positive integers x, y, z su...

1977: The first mathematical theorem to be proven by a computer: No more than four colors are required to c...

2002: Preda Mihailescu proved Catalan’s conjecture - 8 and 9 are the only pair of consecutive perfect power...

1970: Martin Gardner described Bradley Efron’s invention of a set of 4 nontransitive dice

2017: Heilman ...

2005: The number of completed 9x9 Sudoku squares is: 6,670,903,752,021,072,936,960

2007: There exists a ...

2006: A formula for the average number of loops around an object in an n-step random walk on a plane.

Mo...

1995: The Double Bubble Theorem: the shape that encloses and separates two given volumes and has the minima...

1973: Václav Chvátal proves that (the floor of n/3) is the upper bound for the number of guards needed to ...

2016: Aziz and Mackenzie found a solution of the envy-free cake-cutting problem for n people in a bounded ...

1985: Stein discovers the 14th type of pentagon that tiles the plane.

2015: Mann, McLoud, & Von Derauthe...

1976: The use of prime numbers in cryptography.

2008: The discovery of the first prime number with more ...

1995: At least 20 moves are necessary for solving certain scrambled states  of the Rubik’s cube. (A move is...

1962: Gale and Shapley presented and algorithm for finding a stable matching for any equal numbers of men a...

2008-9: Computational solutions for drilling perfect squares holes and regular hexagonal holes.

2009: A ...

Is every NP problem (i.e., a problem for which a solution exists that can be checked in polynomial runtime)...

1975: Steve Selvin – A solution to Monty Hall Problem. Based upon five assumptions, the odds of winning a c...

1968: John Hammersley proved that the upper bound of the area of a sofa which can be moved around an L-shap...

Coming Soon

1968: Braess' paper on using the notion of equilibria to study traffic includes a surprise---closing roads...

Coming Soon