EPRIMES

Find the first n-digit primes in consecutive digits of e.

Recently, Google Inc. created a few highway billboard signs asking passersby to find the first ten-digit prime within consecutive digits of e.

Certainly the Mathworks File Exchange must address such a challenge!

Unfortunately, the answer to the Google billboard question was quickly published in the media, so the answer is readily available. Nevertheless, if you wish to solve the problem yourself, please feel free to ignore those publications and this program.

This program begins with the first one-digit prime and continues locating larger and larger primes. The program has an arbitrary stoping point at 500 digits. Also, to save space there are only 10,000 stored digits of e, so there is a limit (much larger than 500) to how large your desired prime can be using this code.

Probable prime calculations are employed using Java. (See notes under the function ISPR.M, submitted previously.)

Obvious note: Google is a trademark of Google, Inc.