The Problem: Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444486645238749 30358907296290491560440772390713810515859307960866 70172427121883998797908792274921901699720888093776 65727333001053367881220235421809751254540594752243 52584907711670556013604839586446706324415722155397 53697817977846174064955149290862569321978468622482 83972241375657056057490261407972968652414535100474 82166370484403199890008895243450658541227588666881 16427171479924442928230863465674813919123162824586 17866458359124566529476545682848912883142607690042 24219022671055626321111109370544217506941658960408 07198403850962455444362981230987879927244284909188 84580156166097919133875499200524063689912560717606 05886116467109405077541002256983155200055935729725 71636269561882670428252483600823257530420752963450 My Solution (in Java):

# Solution: Project Euler Problem 7

The Problem: What is the 10 001st prime number? My Solution (in Python): Feedback is always appreciated!

# Solution: Project Euler Problem 6

The Problem: Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. My solution (in Java): Straightforward problem. As always, I love feedback on how this solution could be improved!

# Solution: Project Euler Problem 5

The Problem: What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20 My Solution (in C++):

# Solution: Project Euler Problem 4

The Problem: 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. My solution (in C++): Comment if you know a way to think about this problem that leads to […]

# Solution: Project Euler Problem 3

The Problem: What is the largest prime factor of the number 600851475143 ? My solution (in C++): This may be faster if I pre-generate primes less than the input using the Sieve of Eratosthenes method, then dividing by those primes.

# Solution: Project Euler Problem 2

The problem: By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. My solution (in python):

# Solution: Project Euler Problem 1

The problem: Find the sum of all the multiples of 3 or 5 below 1000. My solution was just to use the principle of inclusion/exclusion. No code necessary.