um, I used his code, slightly fine-tuned it, and got the solution.... in .35 seconds (running time, not fine-tuning time ;). On my dinky old notebook. So I'm inclined to believe it is possible... Though perhaps my sense of what "fine-tuning" entails doesn't mesh with yours... spoiler alert, more below.
Note that his code doesn't really (need to) create a sieve of Eratosthenes all the way to n, but only to sqrt(n). It then tests for divisibility. Though it is in this that some of the problems lie with the original code. I'm happy to share my revision with anyone that wants it. It is pretty rough, consistent with my Python (and math!) skills... it's really quite close to his code. -- Keith
_______________________________________________ Tutor maillist - Tutor@python.org To unsubscribe or change subscription options: https://mail.python.org/mailman/listinfo/tutor
