A Mersenne number is a prime number that has the structure of 2^n - 1. This project is an algorism that detects and inserts Mersenne numbers into a list.
It takes about a million years for scratch to insert the 50th Mersenne number and beyond since the number is so big(it takes 60 papers capable of holding 2600 characters) and scratch is very slow. Thus, if you're waiting for the 51st Mersenne number to pop up, good luck :P Between, if you find a new Mersenne number, you can earn massive money. However, many people are using supercomputers(really fast computers) and compact algorisms to find Mersenne numbers. So most of the numbers can be printed out in one's life is found.
