http://www.geekality.net/2009/09/18/project-euler-problem-4/ With a hint of Social Ineptitude Tue, 07 Feb 2012 09:05:01 +0000 hourly 1 http://wordpress.org/?v=3.3.1 http://www.geekality.net/2009/09/18/project-euler-problem-4/#comment-12 seyedx Tue, 22 Sep 2009 08:18:09 +0000 http://www.geekality.net/?p=181#comment-12 There must be an easier mathematical way of solving this. I realised that any palindromic number has 11 as a modulo. So annoying, there must be an easier way to do this. There must be an easier mathematical way of solving this. I realised that any palindromic number has 11 as a modulo. So annoying, there must be an easier way to do this.

]]> http://www.geekality.net/2009/09/18/project-euler-problem-4/#comment-11 Torleif Tue, 22 Sep 2009 06:56:29 +0000 http://www.geekality.net/?p=181#comment-11 It takes between 3 and 8 milliseconds depending on if I run in release or debug mode and what it feels like. It is run as a test case under TestDriven.Net using NUnit though, so I don't really know if it could run faster if run in a more standard way. It takes between 3 and 8 milliseconds depending on if I run in release or debug mode and what it feels like. It is run as a test case under TestDriven.Net using NUnit though, so I don’t really know if it could run faster if run in a more standard way.

]]> http://www.geekality.net/2009/09/18/project-euler-problem-4/#comment-10 Torleif Tue, 22 Sep 2009 06:55:56 +0000 http://www.geekality.net/?p=181#comment-10 @Vegar, those algorithms seems to just generate palindromes though. In this challenge you also have the requirement that they have be the product of a 3 digit number. Maybe some could still be useful, but mine is fast enough for now :) @Vegar, those algorithms seems to just generate palindromes though. In this challenge you also have the requirement that they have be the product of a 3 digit number. Maybe some could still be useful, but mine is fast enough for now

]]> http://www.geekality.net/2009/09/18/project-euler-problem-4/#comment-6 seyedx Mon, 21 Sep 2009 11:48:06 +0000 http://www.geekality.net/?p=181#comment-6 What was your time Torleif? Did you time the script? What was your time Torleif? Did you time the script?

]]> http://www.geekality.net/2009/09/18/project-euler-problem-4/#comment-5 Vegar Mon, 21 Sep 2009 10:51:16 +0000 http://www.geekality.net/?p=181#comment-5 delphi.about.com did an contest on palindroms a couple of weeks ago. <a href="http://delphi.about.com/od/delphichallengesexercises/qt/delphi-palindromic-numbers.htm" rel="nofollow">Check it out</a> for some ideas to faster algorithms. delphi.about.com did an contest on palindroms a couple of weeks ago. Check it out for some ideas to faster algorithms.

]]>