All Questions
3 questions
7
votes
5
answers
1k
views
Project Euler #35 - Circular primes solution is slow
This is my code for project euler #35 (in Python):
The number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.
There are thirteen such ...
- 223
1
vote
3
answers
7k
views
Shortest prime number generator we could come up with?
I worked with a friend on the following prime number generator. Our goal was to make it as short and as fast as possible. This is what we came up with:
...
- 523
1
vote
2
answers
273
views
Sieve of Erathosthenes speedup
While reading HackerNews, I learned about a data set of the first 50 million primes. This would be a lot, but his website has disclaimer:
n this directory I have the first fifty million primes in ...
- 242