Arevalos Blog

I have solved problem 10 of Project Euler. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 10 is here

Problem010_SieveOfErastothenes.java

I have solved problem 9 of Project Euler. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 9 is here

Problem009.java

I have solved problem 8 of Project Euler. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 8 is here

Problem008.java

I have solved problem 7 of Project Euler. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 7 is here

Problem007.java

I have solved problem 6 of Project Euler. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 6 is here

Problem006.java

The solution only has the optimization of finding the sum of the nth number through the formula

sum(n) = n * ( n + 1) / 2

Hope the solution is understandable. If not, don’t hesitate to put a comment.

I have solved problem 5 of Project Euler. I created a google code hosted project here where you can check out the solutions to the problems I have solved. In particular the solution to problem 5 is here

Problem005.java

A brute force approach to solving this problem. The solution has a minor optimization which is to increase the outer loop by 20 (the “limit” variable) in each iteration.

Hope the solution is understandable. If not, don’t hesitate to put a comment.