Project Euler 9: Special Pythagorean triplet – SOLVED

Project Euler 9 Problem Statement A Pythagorean triplet is a set of three natural numbers, a ≤ b < c, for which, For example, . There exists exactly one Pythagorean triplet for which a + b + c = 1000.Find the product abc. Solution A Pythagorean triple consists...

Project Euler 13: Large sum – SOLVED

Project Euler 16 Problem Statement Work out the first ten digits of the sum of the following one-hundred 50-digit numbers. 3710728753390210279879799822083759024651013574025046376937677490009712648124896970078050417018260538 … {data continues} Solution Summing a...

Project Euler 19: Counting Sundays – SOLVED

Project Euler 19 Problem Statement Originally published on blog.dreamshire.com, M. Molony, MARCH 26, 2009. You are given the following information, but you may prefer to do some research for yourself. A leap year occurs on any year evenly divisible by 4, but not on a...

Project Euler 24: Lexicographic permutations – SOLVED

Project Euler 24 Problem Statement A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The...

Project Euler 25: N-digit Fibonacci number – SOLVED

Project Euler 25 Problem Statement The Fibonacci sequence is defined by the recurrence relation: Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1. Hence the first 12 terms will be: {1,1,2,3,5,8,13,21,34,55,89,144} The 12th term, F12, is the first term to contain three...