2025-02-12 21:16:27 +00:00
|
|
|
# project-euler
|
|
|
|
|
|
2025-02-12 23:34:43 +01:00
|
|
|
Several project euler problems solved in C++
|
|
|
|
|
|
2025-02-13 13:01:28 +01:00
|
|
|
# Euler problem 1 :
|
2025-02-12 23:34:43 +01:00
|
|
|
|
2025-02-13 13:04:12 +01:00
|
|
|
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 1000.
|
2025-02-13 13:01:28 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
# Euler problem 2 :
|
|
|
|
|
|
2025-02-13 13:04:12 +01:00
|
|
|
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 four million, find the sum of the even-valued terms.
|
2025-02-17 15:07:16 +01:00
|
|
|
|
2025-02-17 15:13:53 +01:00
|
|
|
# Euler problem 3 :
|
|
|
|
|
|
|
|
|
|
The prime factors of 13195 are 5, 7, 13 and 29
|
|
|
|
|
What is the largest prime factor of the number 600851475143
|
|
|
|
|
|
|
|
|
|
[wiki](https://baobabfruit.ddns.net/en/code/project-euler/prime-numbers)
|
