Comments on: Project Euler Problem 3 http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/ Incoherent and disjointed opinionated drivel from somewhere near London Fri, 12 Feb 2010 23:33:43 +0000 http://wordpress.org/?v=2.9.1 hourly 1 By: uberlieder http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/comment-page-1/#comment-15991 uberlieder Tue, 14 Jul 2009 21:07:44 +0000 http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/#comment-15991 Thanks for this, massively shortened the time needed. This is a great way to pick up a new language. Thanks for this, massively shortened the time needed. This is a great way to pick up a new language.

]]> By: Project Euler - Problem 3 - Javascript | alt42 http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/comment-page-1/#comment-14352 Project Euler - Problem 3 - Javascript | alt42 Wed, 20 May 2009 11:46:03 +0000 http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/#comment-14352 [...] completed the problem I Googled it and found Basildon Coder’s blog. He explains the various approaches and improvements well. I  felt a bit better when he introduced [...] [...] completed the problem I Googled it and found Basildon Coder’s blog. He explains the various approaches and improvements well. I  felt a bit better when he introduced [...]

]]> By: -jn- http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/comment-page-1/#comment-913 -jn- Sun, 20 Apr 2008 00:09:18 +0000 http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/#comment-913 Interesting! I learned a bit more Python by reading your post. With respect to "only generate primes up to the square root of N", no fudge-factor is needed. Simply keep track of the running quotient. After dividing 15 by 3 to get a quotient of 5, and verifying that 4 is > √15, you know that 5 is prime. It can't have two factors greater than √15 else it woud be > 15 itself. It can't have a factor less than √15, because all of those factors have already been eliminated. Thanks for keeping it going! Interesting! I learned a bit more Python by reading your post.

With respect to “only generate primes up to the square root of N”, no fudge-factor is needed. Simply keep track of the running quotient. After dividing 15 by 3 to get a quotient of 5, and verifying that 4 is > √15, you know that 5 is prime.

It can’t have two factors greater than √15 else it woud be > 15 itself. It can’t have a factor less than √15, because all of those factors have already been eliminated.

Thanks for keeping it going!

]]> By: Prime time programming « Sliding up the banister http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/comment-page-1/#comment-912 Prime time programming « Sliding up the banister Sat, 19 Apr 2008 23:32:29 +0000 http://basildoncoder.com/blog/2008/04/07/project-euler-problem-3/#comment-912 [...] noticed that Basildon Coder had a post on this same problem. I held off reading it until after working through my own approach, [...] [...] noticed that Basildon Coder had a post on this same problem. I held off reading it until after working through my own approach, [...]

]]>