Sundry quick scripts pertaining to primes.
One quiet work day on a Artic research base, my collegue, a proud C++ programmer and Arch user, challenged me and another to a simple challenge: "Who can right the quickest script to count the number of primes less than X?" I generally kept my experience in FORTRAN developed by creating numerical simulations of in relativistic cosmology for my PhD research quiet, from a feeling of the daggyness of it. This changed that, "prime_finder" is the result. I've now added some additional short scripts, which are in some sense related.
document... comment...