http://blogs.msdn.com/alfredth/archive/2009/05/06/prime-numbers-code-challenges-and-programming-languages.aspxdigg_url = "http://blogs.msdn.com/alfredth/archive/2009/05/08/prime-numbers-code-challenges-and-programming-languages.aspx";digg_title = "Prime Numbers, Code Challenges, and Programming Languages";digg_bgcolor = "#EEEEEE";digg_skin = "normal"; digg_urlen-USCommunityServer 2.1 SP1 (Build: 61025.2)http://blogs.msdn.com/alfredth/archive/2009/05/06/prime-numbers-code-challenges-and-programming-languages.aspx#9592160Thu, 07 May 2009 00:45:05 GMT91d46819-8472-40ad-a661-2c78acb4018c:9592160Garth<p>For those of us that are clueless - what values are going in txtStart.Text and txtEnd.Text?</p> http://blogs.msdn.com/alfredth/archive/2009/05/06/prime-numbers-code-challenges-and-programming-languages.aspx#9592280Thu, 07 May 2009 01:43:50 GMT91d46819-8472-40ad-a661-2c78acb4018c:9592280Alfred Thompson<p>Sorry. Those are inputs from textboxes. I was starting my test with 2,200,000,000 and ending with 3,000,000,000.</p> http://blogs.msdn.com/alfredth/archive/2009/05/06/prime-numbers-code-challenges-and-programming-languages.aspx#9608851Wed, 13 May 2009 08:34:21 GMT91d46819-8472-40ad-a661-2c78acb4018c:9608851Clint Rutkas<p>We used the same method, brute force. &nbsp;I just made mine so I could abuse my processor a bit more. &nbsp;Excellent solution Alfred.</p> http://blogs.msdn.com/alfredth/archive/2009/05/06/prime-numbers-code-challenges-and-programming-languages.aspx#9609383Wed, 13 May 2009 17:50:38 GMT91d46819-8472-40ad-a661-2c78acb4018c:9609383Alfred Thompson<p>Note that there is some interesting discussion going on at Clint's blog post so stop by there if you haven't already (or not recently) <a rel="nofollow" target="_new" href="http://www.betterthaneveryone.com/archive/2009/05/06/861.aspx">http://www.betterthaneveryone.com/archive/2009/05/06/861.aspx</a></p>