|
Project Information
Links
|
IntroductionJava implementation of project euler problems. Created by Justin Wetherell Google: http://code.google.com/p/project-euler-in-java Github: http://github.com/phishman3579/project-euler-in-java LinkedIn: http://www.linkedin.com/in/phishman3579 E-mail: mailto:phishman3579@gmail.com Twitter: http://twitter.com/phishman3579 Problems Solved- 1: Add all the natural numbers below one thousand that are multiples of 3 or 5.
- 2: By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.
- 3: Find the largest prime factor of a composite number.
- 4: Find the largest palindrome made from the product of two 3-digit numbers.
- 5: What is the smallest number divisible by each of the numbers 1 to 20?
- 6: Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
- 7: What is the 10001st prime number.
- 8: Find the greatest product of five consecutive digits in the 1000-digit number.
- 9: There exists exactly one Pythagorean triplet for which a + b + c = 1000.
- 10: Find the sum of all the primes below two million.
|