TheAlgorithms-C/project_euler
2021-04-25 19:44:15 -05:00
..
problem_1 minor doc fix in euler prob1 sol1 2020-06-30 13:39:31 -04:00
problem_2 formatting source-code for 5bba04b671 2020-06-28 15:25:37 +00:00
problem_3
problem_4
problem_5 feat: Project Euler Problem 5 - #162 (#599) 2020-09-03 08:52:21 -04:00
problem_6
problem_7 feat: Project Euler Problem 7 - #167 (#598) 2020-09-03 08:51:59 -04:00
problem_8 added authorship to docs 2020-06-06 14:51:49 -04:00
problem_9 added authorship to docs 2020-06-06 14:51:49 -04:00
problem_10 added authorship to docs 2020-06-06 14:51:49 -04:00
problem_12 added authorship to docs 2020-06-06 14:51:49 -04:00
problem_13 fix possible memory leak 2020-07-13 00:14:29 -04:00
problem_14 fixed documentations 2020-06-28 15:18:52 -04:00
problem_15 fixed documentations 2020-06-28 15:18:52 -04:00
problem_16 formatting source-code for 5bba04b671 2020-06-28 15:25:37 +00:00
problem_19 [bugs & docs] lots of documentation and bug fixes (#554) 2020-07-04 15:05:30 -04:00
problem_20 fixed documentations 2020-06-28 15:18:52 -04:00
problem_21 fixed documentations 2020-06-28 15:18:52 -04:00
problem_22 make identical datatype 2020-07-01 20:21:56 -04:00
problem_23 cleanup some codes for global variables and clang-tidy specs 2020-07-12 23:49:09 -04:00
problem_24
problem_25 cleanup some codes for global variables and clang-tidy specs 2020-07-12 23:49:09 -04:00
problem_26 fix: Revert "fix: LGTM warnings/alerts" commit 2021-04-25 19:44:15 -05:00
problem_401 cleanup some codes for global variables and clang-tidy specs 2020-07-12 23:49:09 -04:00
CMakeLists.txt fix install folder 2020-06-06 17:10:04 -04:00
README.md

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?