Python/Project Euler
Christian Bender ca5c6f268a
Merge pull request #292 from TheAlgorithms/fixed_solv_4_problem1
fixed solution 4 of problem 1
2018-04-15 23:53:37 +02:00
..
Problem 01 Merge pull request #292 from TheAlgorithms/fixed_solv_4_problem1 2018-04-15 23:53:37 +02:00
Problem 02 Added Solution to Problem 2 in a simple approach 2018-03-22 15:50:49 +05:30
Problem 03 Merge branch 'master' into modernize-python2-code 2017-12-13 16:32:28 +01:00
Problem 04 Merge branch 'master' into modernize-python2-code 2017-12-13 16:32:28 +01:00
Problem 05 Added a Solution using Euclidean Algo 2018-03-22 19:29:44 +05:30
Problem 06 Modernize Python 2 code to get ready for Python 3 2017-11-25 10:23:50 +01:00
Problem 07 Merge branch 'master' into modernize-python2-code 2017-12-13 16:32:28 +01:00
Problem 08 Adding Problem_08 2018-02-27 19:19:53 +05:30
Problem 9 Added General solution for Problem 9 2018-03-23 16:27:25 +05:30
Problem 10 Merge branch 'master' into master 2018-03-19 10:11:24 -04:00
Problem 11 Added xrange compatibility for Python 3 2018-03-19 11:26:47 -04:00
Problem 12 Solution to Problem 12 2018-03-28 19:11:14 -04:00
Problem 13 Modernize Python 2 code to get ready for Python 3 2017-11-25 10:23:50 +01:00
Problem 14 Modernize Python 2 code to get ready for Python 3 2017-11-25 10:23:50 +01:00
Problem 15 Combinatoric solution using Pascal's Triangle to Problem 15 2018-03-14 15:39:52 -04:00
Problem 16 Problem 16 Added 2017-11-20 01:34:21 +05:30
Problem 17 Solution to Problem 17 2018-03-18 17:45:28 -04:00
Problem 19 Solution to Problem 19 2018-03-25 23:14:59 -04:00
Problem 20 another sol for problem_20 2018-03-03 10:30:31 +05:30
Problem 21 Solution to Problem 21 2018-03-22 11:27:50 -04:00
Problem 22 Solution to Problem 22 2018-03-20 20:23:51 -04:00
Problem 25 Fixed xrange compatibility for Python 3 2018-03-19 09:29:46 -04:00
Problem 28 Fixed xrange compatibility for Python 3 2018-03-19 09:29:46 -04:00
Problem 29 Modernize Python 2 code to get ready for Python 3 AGAIN 2018-01-21 08:25:19 +01:00
Problem 36 Solution to Problem 36 2018-04-02 12:20:53 -04:00
Problem 40 Solution to Problem 40 2018-04-02 23:46:28 -04:00
Problem 48 Solution to Problem 48 2018-03-18 13:59:01 -04:00
Problem 52 Solution to Problem 52 2018-04-03 00:04:38 -04:00
Problem 53 Solution to Problem 53 2018-03-24 21:48:48 -04:00
Problem 76 Solution to Problem 76 2018-03-22 12:09:45 -04:00
README.md Added Solution 2017-11-27 10:44:32 +05:30

ProjectEuler

Problems are taken from https://projecteuler.net/.

Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Project Euler is ideal for mathematicians who are learning to code.

Here the efficiency of your code is also checked. I've tried to provide all the best possible solutions.

PROBLEMS:

  1. 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 N.

  2. 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, find the sum of the even-valued terms.
    e.g. for n=10, we have {2,8}, sum is 10.

  3. The prime factors of 13195 are 5,7,13 and 29. What is the largest prime factor of a given number N? e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17.

  4. 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 which is less than N.

  5. 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible(divisible with no remainder) by all of the numbers from 1 to N?

  6. 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 N natural numbers and the square of the sum.

  7. By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the Nth prime number?

  8. A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a^2 + b^2 = c^2 There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.

  9. The following iterative sequence is defined for the set of positive integers: n → n/2 (n is even) n → 3n + 1 (n is odd) Using the rule above and starting with 13, we generate the following sequence: 13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1 Which starting number, under one million, produces the longest chain?

  10. 2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 2^1000?

  11. n! means n × (n 1) × ... × 3 × 2 × 1 For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27. Find the sum of the digits in the number 100!