Project-Euler-Problems

This repository contains the the project euler problems solved by me.

Problem 1: Multiples of 3 or 5

Description: 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.
File name: MultiplesOfThreeOrFive.java

Problem 2: Even Fibonacci Numbers

Description: Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms
File name: EvenFibonacciNumber.java

Problem 3: Largest Prime Factor

Description: The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?
File name: LargestPrimeFactor.java

Problem 4: Largest Palindrome Product

Description: 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.
File name: LargestPalindromeProduct.java

Problem 5: Sum Square Difference

Description: The sum of the squares of the first ten natural numbers is,
1^2 + 2^2 + ... + 10^2 = 385 The square of the sum of the first ten natural numbers is,
(1 + 2 + ... + 10)^2 = 552 = 3025
Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 − 385 = 2640.
Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.

File name: SumSquareDifference.java

Program: A program to find prime factors of a number

File name: PrimeFactorProgram.java

Program: A program to check if the number is palindrome or not

File name: PalindromeProgram.java

patilankita79 / project-euler-problems Goto Github PK