Project Euler Solutions
This repository contains solutions to the problems of project Euler. It is part of the ProjectEuler100 challenge from freecodecamp.org.
Solutions
Each solution is code in its own filed, named according to the problem number 'x' with the respective 'py' extension ('x.py').
-
- Adds the multiples of 3 or 5 below a certain number
-
- Adds the even valued numbers of the fibonacci series below limit
-
- Finds the largest prime factor of a number
-
- Finds the largest palindrome product of two numbers of 3 digits
-
- Finds the smallest number that can be divided by the numbers from 1 to n
Usage
Run each file in python from the console. The solution will be printed.
License
MIT