Prime Finder It is a very simple prime number finder method, but it starts with (12 * N) where N in [1, ..., k], and takes the differences between (12 * N) and the first prime number greater than (12 * N). There are interesting patterns that occur.