Comments on: Problem 10 – More prime numbers http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/ Not quite extinct! Wed, 04 Mar 2009 05:19:46 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: Proyecto Euler - Problemas 5 a 10 | Buanzolandia http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-108 Proyecto Euler - Problemas 5 a 10 | Buanzolandia Tue, 21 Oct 2008 06:22:41 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-108 [...] me qued?? enojado porque tardaba mucho, as?? que googli?? un toque y encontr?? este post que mostraba otra forma de generar n??meros primos. Y lo implement??. La idea es ir marcando todos [...] [...] me qued?? enojado porque tardaba mucho, as?? que googli?? un toque y encontr?? este post que mostraba otra forma de generar n??meros primos. Y lo implement??. La idea es ir marcando todos [...]

]]> By: Proyecto Euler - Problemas 5 a 10 | Buanzolandia http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-107 Proyecto Euler - Problemas 5 a 10 | Buanzolandia Tue, 21 Oct 2008 04:22:04 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-107 [...] me quedé enojado porque tardaba mucho, así que googlié un toque y encontré este post que mostraba otra forma de generar números primos. Y lo implementé. La idea es ir marcando todos [...] [...] me quedé enojado porque tardaba mucho, así que googlié un toque y encontré este post que mostraba otra forma de generar números primos. Y lo implementé. La idea es ir marcando todos [...]

]]> By: Aureliano http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-106 Aureliano Tue, 21 Oct 2008 02:46:19 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-106 Nice solution. I've been inspired by your version and implemented something similar in ruby. I'm blogging about how I'm solving the problems at the Euler project (I've already solved the first 10) if anyone wants to take a peek. Aureliano. Nice solution. I’ve been inspired by your version and implemented something similar in ruby. I’m blogging about how I’m solving the problems at the Euler project (I’ve already solved the first 10) if anyone wants to take a peek.

Aureliano.

]]> By: zzzdude http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-27 zzzdude Tue, 26 Feb 2008 06:15:27 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-27 My solution has been running for the past three minutes, but I am not using python, or your method. I have it check every number under 2 million to see if its a prime, if it is, then add to a variable. It must be my method of finding the prime.... My solution has been running for the past three minutes, but I am not using python, or your method.
I have it check every number under 2 million to see if its a prime, if it is, then add to a variable.
It must be my method of finding the prime….

]]> By: All hail the user » AaronStaves.com http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-18 All hail the user » AaronStaves.com Thu, 07 Feb 2008 05:51:31 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-18 [...] apologize for the lazyness in posting, but I have been somewhat busy between work, side projects and other things. So hopefully I can get back into the habit of posting.   « Nokia [...] [...] apologize for the lazyness in posting, but I have been somewhat busy between work, side projects and other things. So hopefully I can get back into the habit of posting.   « Nokia [...]

]]> By: IrrationalPi http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-16 IrrationalPi Sat, 02 Feb 2008 19:37:03 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-16 This is wild, I did #10 today, then came to your site, and found you had also. Nice solution. I chose to find the non-primes instead and use set difference to find the primes from there. Runs pretty fast on my machine (<1 second). I also tried an adaptation of your approach. You can use sum(list) instead of your last loop. That might even make it run faster. This is wild, I did #10 today, then came to your site, and found you had also.

Nice solution. I chose to find the non-primes instead and use set difference to find the primes from there. Runs pretty fast on my machine (<1 second). I also tried an adaptation of your approach.

You can use sum(list) instead of your last loop. That might even make it run faster.

]]> By: WisePi::Project Euler » Problem 10 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/comment-page-1/#comment-15 WisePi::Project Euler » Problem 10 Sat, 02 Feb 2008 19:33:45 +0000 http://aaronstaves.com/2008/01/02/problem-10-more-prime-numbers/#comment-15 [...] friend Aaron had an interesting idea to use a bit list to keep the primes (link). I thought this was a sweet way to do things, so I tried adapting my code. First I had a boolean [...] [...] friend Aaron had an interesting idea to use a bit list to keep the primes (link). I thought this was a sweet way to do things, so I tried adapting my code. First I had a boolean [...]

]]>