Notepad? I would never allow that to constrain the processing. You can always write simple utility programs to extract the primes for subfiles that you can then tweak to display in Notepad, list boxes, grids, or whatever.

So, all my long integers are packed into one file that in essence represents a huge lookup table. The file is now approaching 180,000 Kb as I write. That's 45 million primes gathered to date.

I considered rewriting some of the code so that checking for previous primes could be done within the collection file to skip them and possibly improve speed. We used to do this years ago by reading in 1 Mb chunks into huge memory arrays as they became available. However, I think that read and skip routine could actually slow down the code inside the main loop. I may experiment with that after the file is completely built.

I suppose one possible use for this master file is that you can then check extremely fast if any number less that 2^31 is a prime using a search through the file. We can experiment with optimal search routines. Other than that, I am not sure what to do with the primes. Any other ideas?