mirrors/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C synced 2024-11-22 21:41:59 +03:00
Code Issues Packages Projects Releases Wiki Activity
d4d1902c98
TheAlgorithms-C/project_euler
History
Krishna Vedala 6ff4ac36d8
Merge branch 'project_euler/problem_16' into project_euler/master 
# Conflicts:
#	DIRECTORY.md
2020-03-30 15:49:17 -04:00
..
Problem 01 added sol4.c 2019-06-11 19:02:34 +05:30
Problem 02 Refactor 2018-10-08 21:18:35 +05:30
Problem 03 Refactor 2018-10-08 21:18:35 +05:30
Problem 04 Project Euler Solution 2019-10-01 19:51:55 +05:30
Problem 05 Project Euler Solution 2019-10-01 19:51:55 +05:30
Problem 06 Project Euler Solution 2019-10-01 19:51:55 +05:30
Problem 07 Project Euler Solution 2019-10-01 19:51:55 +05:30
Problem 08 an optimized solution - O(n) complexity 2020-03-29 20:28:46 -04:00
Problem 09 optimized solution using only one loop 2020-03-29 21:33:58 -04:00
Problem 10 fixed bug when n=5000 2020-03-29 23:20:41 -04:00
Problem 12 added algorithm summary in comments 2020-03-30 08:42:43 -04:00
Problem 13 solution using arbitrary length decimal number addition using array allocation 2020-03-30 10:48:24 -04:00
Problem 14 added printf info 2020-03-30 11:42:49 -04:00
Problem 15 combinatorial solution 2020-03-30 14:49:54 -04:00
Problem 16 algorithm from http://www.cplusplus.com/forum/beginner/68694/ 2020-03-30 15:43:16 -04:00
README.md Refactor 2018-10-08 21:18:35 +05:30

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?