I was thinking about the algorithms that computer programs use in order to discover primes. I assume that it takes really large numbers and tries to divide it by every known prime number less than that number. However, the fact that a new prime number was found requires that all the older algorithms include the new prime number in their programming. I imagine this uses a lot of processing power and increases the length of time it takes to discover the next prime number.

So then I started to think, could there be a function used to map out how long it takes to find the next prime number. Based on the logic described above, it will take longer and longer to find more and more primes. In this case, there will eventually be not enough time left to discover the next prime because the world will end after all in 2012. :-P