Problem: By replacing the 1st digit of *3, it turns out that six of the nine possible values: 13, 23, … More

# Category: Project Euler: 46, 47, 48, 49, 50, 51

Project Euler problems

# Project Euler – Problem # 50 – Solved with Python

Problem: The prime 41, can be written as the sum of six consecutive primes: 41 = 2 + 3 + … More

# Project Euler – Problem # 49 – Solved with Python

Problem: The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two … More

# Project Euler – Problem # 48 – Solved with Python

Problem: The series, 11 + 22 + 33 + … + 1010 = 10405071317. Find the last ten digits of … More

# Project Euler – Problem # 47 – Solved with Python

Problem: The first two consecutive numbers to have two distinct prime factors are: 14 = 2 * 7 15 = … More

# Project Euler – Problem # 46 – Solved with Python

Problem: It was proposed by Christian Goldbach that every odd composite number can be written as the sum of a … More