Over the last week or so I’ve been working on some old code of mine. As the title of this post suggests it is to do with that odd pastime of mathematicians: finding prime numbers. I have made a few attempts to make lists of prime numbers over the years in numerous different ways. This is a small introduction to what will no doubt be a small series of many posts. This is an on going work in C++ although I’ll also be writing about an implementation I wrote in Python and a discussion of why I no longer use it for large calculations. During this process I have also taught myself to use git and in particular GitHub. So if you are interested in being ahead of my posts here is my GitHub and in particular this project.
Recent Posts
Archives
Tag Cloud
autogenerate bash bitbucket c++ c++11 caching cd cmd code command line curiously-recurring-template-pattern cygwin design pattern emacs first functional games git github gui hangman hello world hg keyword LaTex linux lisp make maths mercurial pdf pdflatex Perl premake prime primes python standards style template testing tkinter tools UnitC++ unittest version controlCategories
- C++ (12)
- C++11 (6)
- Code (16)
- CodeProject (15)
- Command Line (2)
- Design Patterns In Python (6)
- Functional (1)
- Games (2)
- GUI (1)
- LaTex (2)
- Lisp (1)
- Make (2)
- Maths (2)
- Note (1)
- Perl (2)
- premake (1)
- Python (11)
- Style (1)
- Testing (3)
- Tkinter (1)
- Uncategorized (3)
- UnitC++ (1)
- Utility (4)
- Version Control (1)
Copyright
© 2013 by David Corne.

This work is licensed under a Creative Commons Attribution-ShareAlike 3.0 Unported License.