At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
Try this http://mathworld.wolfram.com/SieveofEratosthenes.html
There are a bunch of efficient algorithms out there for generating prime nums, such as the Sieve of Eratosthenes, but for the first 6.00 assignment even simply caching primes you've already found would be very quick
trial division + caching* would be fast enough.... for tiny primes like 7919 even trial division without caching is good enough :-D
I programmed it to look for factors whos product was the number I was testing. The test started out true unless it found the two factors. That worked fine for the 1st 100 primes or so, but the 'trues per second' seem to be on the wrong end of an retricemptote approaching 0. lol
only check for factors till sqrt(n)
Great. If you like, you can post the code on a site like http://ideone.com and we can take a look at it.
Maybe. I doubt it's impressive. This is the first program I've ever written.
Took me a long time, too...
That's okay; the first time I tried out 6.00, it took me ages to get used to it.
Turns out I hadn't watched the lecture that spelled this out yet. Light bulbs!!! I redid it and it runs in about 10 seconds now. I learned a lot messing around though.