project-euler.blogspot.com
Project Euler Walkthrough: Project Euler Problem 4 (Java)
http://project-euler.blogspot.com/2010/08/project-euler-problem-4-java.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Sunday, August 8, 2010. Project Euler Problem 4 (Java). Let's switch back to Java to solve the fourth problem of Project Euler. A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91. Find the largest palindrome made from the product of two 3-digit numbers. Compute all the products of three-digit numbers. Again, take a look at the source code even if ...
project-euler.blogspot.com
Project Euler Walkthrough: Introduction
http://project-euler.blogspot.com/2009/03/introduction.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Tuesday, March 24, 2009. Welcome to Project Euler Walkthrough! This site is dedicated to being a guide to solving the many challenges presented in Project Euler. Before I actually get started working on the problems, I'll provide a brief introduction explaining the purpose of this site, what my goal's are, and a little bit about myself. I recently discovered the website of Project Euler. So why this blog? So who am I?
project-euler.blogspot.com
Project Euler Walkthrough: September 2009
http://project-euler.blogspot.com/2009_09_01_archive.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Sunday, September 20, 2009. Project Euler Problem 3 (Python). The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143? That takes care of the task of generating prime numbers, so what about factoring this large number? Well, if the primer number we are testing as a factor is greater than the square root of the number, then it can't be a factor. Why? Find the sum of all th...
project-euler.blogspot.com
Project Euler Walkthrough: April 2009
http://project-euler.blogspot.com/2009_04_01_archive.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Thursday, April 2, 2009. Project Euler Problem 1 (Java). 8220;If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6, and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.”. Natural Number – Integer greater than zero. (1, 2, 3, 4, 5…). Multiple – Number that is the product of the given number and any factor. (9 is a multiple of 3). Now, this simpl...
project-euler.blogspot.com
Project Euler Walkthrough: Project Euler Problem 3 (Python)
http://project-euler.blogspot.com/2009/09/project-euler-problem-3-python.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Sunday, September 20, 2009. Project Euler Problem 3 (Python). The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143? That takes care of the task of generating prime numbers, so what about factoring this large number? Well, if the primer number we are testing as a factor is greater than the square root of the number, then it can't be a factor. Why?
project-euler.blogspot.com
Project Euler Walkthrough: Project Euler Problem 2 (Python)
http://project-euler.blogspot.com/2009/09/project-euler-problem-2-python.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Friday, September 18, 2009. Project Euler Problem 2 (Python). Alright, for this problem let's switch things up a bit and go with some Python code. I'm currently working with Python on some projects for college, so I decided to go ahead and solve some of these problems in Python rather than continue on in Java. Ok, enough talk, let's see what the second problem has in store for us. Here's what I ended up with:.
project-euler.blogspot.com
Project Euler Walkthrough: August 2010
http://project-euler.blogspot.com/2010_08_01_archive.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Sunday, August 8, 2010. Project Euler Problem 4 (Java). Let's switch back to Java to solve the fourth problem of Project Euler. A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91. Find the largest palindrome made from the product of two 3-digit numbers. Compute all the products of three-digit numbers. Again, take a look at the source code even if ...
project-euler.blogspot.com
Project Euler Walkthrough: Project Euler Problem 1 (Java)
http://project-euler.blogspot.com/2009/04/project-euler-problem-1.html
My thoughts and research as I attempt to solve the many problems of Project Euler. Thursday, April 2, 2009. Project Euler Problem 1 (Java). 8220;If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6, and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000.”. Natural Number – Integer greater than zero. (1, 2, 3, 4, 5…). Multiple – Number that is the product of the given number and any factor. (9 is a multiple of 3). Now, this simpl...