How do I get there?

## Infinite drive

Posted by mathfail
on August 27, 2010
Comments Off on Infinite drive

## LaTeX difficulty graphs

Posted by mathfail
on August 27, 2010
1 comment

## Go 2 grd skool, k?

Posted by mathfail
on August 26, 2010
Comments Off on Go 2 grd skool, k?

## Mathie internet memes 2

Posted by mathfail
on August 26, 2010
Comments Off on Mathie internet memes 2

## Applications of math

Posted by mathfail
on August 25, 2010
1 comment

## Mathie internet memes 1

Posted by mathfail
on August 25, 2010
Comments Off on Mathie internet memes 1

## Doing math on the ground/wall

Posted by mathfail
on August 24, 2010
1 comment

## Mathematics Patch Notes

Posted by mathfail
on August 24, 2010
1 comment

(via Spiked Math)

**Patch Notes 1.02a**

“Mathematics will never be the same.”

Introducing Probability 2.0

- Upgraded probability to include real numbers in the range from 0 to 2.
- Switching in the monty hall problem is now the same as not switching.
- Due to high demand, correlation now implies causation.

Graph Theory Features

- Fixed glitch in the petersen graph so it is no longer a counter-example.
- Support is no longer offered for hypergraphs.
- Added a new color to the outdated 4-color theorem. We anticipate at least 7 colors available for planar graphs by patch 1.03.

**Number Systems**

- Decimal notation will be phased out next patch. This should fix the long standing bug that 1 = 0.999…
- Due to loneliness, the set of prime numbers now includes the number 1.
- Complex numbers have been deemed no longer complex and will now be known as “easy numbers”.

Proof Changes

- Proof by “reference to inaccessible literature” is no longer accessible.
- A new “proof by picture” widget has been added for mac users.

Miscellaneous

- Support has been added to allow division by 0 fixing the wormhole bug.

## Icosien (game)

Posted by mathfail
on August 23, 2010
1 comment

This is a neat game – it’s called Icosien.

If you know graph theory then essentially the goal of the game is to draw a Eulerian path (a path that visits each edge exactly once) in the given graph.

## Recent Comments