I have solved problem 2 of Project Euler using java. 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 2 is here
What I used for solving the problem was a procedural implementation of the fibonacci series. If you program in java you always have to remember that primitives are faster than Number objects. BTW the solutions is a brute force approach, but it runs pretty fast in Java.
After being persuaded by my friend tr8 to pursue the solving of mathematical problems in the Project Euler site I decided to give it a try. My initial thought was just to browse around, see what was there and nothing more than just poke around.
But I got excited about the problems, they are actually really challenging and entertaining, well, if you like these sort of things. So I started to solve them. As I started to solve them I realized that I should create a repository where I could share the solutions. So I created project euler in google code hosting projects:
http://code.google.com/p/project-euler/
and here am I telling you about the Solution to Project Euler Problem 1 Using Java. For which I used brute force.