Bakarseck / Euler_Challenge

Euler_Challenge

Functions

Multiples Of 3 and 5


      This Function consist to sum all the multiples of 3 and 5 who are under a given number. 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. This function find the sum of all the multiples of 3 or 5 below the provided parameter value number.



Fibonaci Even Sum


      This Function consist to sum all even term of the suit of fibonacci below a given number. 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 n, This function find the sum of the even-valued terms.



Largest Prime Factor


      This Function consist to find the largest prime factor of a given number. The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the given number?

Installation

    git clone https://github.com/Bakarseck/Euler_Challenge.git
    cd Euler_Challenge
    code .

Authors

Bakarseck