Tony Talks Technology
Project Euler — Problem 4
Project Euler — Problem 4
I am going to be blogging my experience with Project Euler and C#. Most of these are naive in implementation, but they get the job done…. For a full collection of the code, go here. ¶ Problem 4 ¶ This one was fun. Got to try out some reversing algorithms. ¶ A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. ¶ Find the largest palindrome made from the product of two 3-digit numbers. ¶ Again, this one reads pretty easily. ¶ This outputs the solution to the problem (906609) and then waits for user input.Tony MorrisNov 22, 2015
Project Euler — Problem 3
Project Euler — Problem 3
I am going to be blogging my experience with Project Euler and C#. Most of these are naive in implementation, but they get the job done…. For a full collection of the code, go here. ¶ Problem 3 ¶ On to prime factors! ¶ The prime factors of 13195 are 5, 7, 13 and 29. ¶ What is the largest prime factor of the number 600851475143 ? ¶ Again, this is a very naive implementation of this problem. ¶ This outputs the solution to the problem (6857) and then waits for user input. ¶ Again, naivety reigns in this solution. The program is checking every number until the maximum factor is found.Tony MorrisNov 22, 2015