by Mike | Oct 31, 2018 | Project Euler

Project Euler 15 Problem Statement Originally published on blog.dreamshire.com, M. Molony, APRIL 19, 2009 . Starting in the top left corner of a 2×2 grid, there are 6 routes (without backtracking) to the bottom right corner. How many routes are there through a 20×20...
by Mike | Oct 26, 2018 | Project Euler

Project Euler 16 Problem Statement 215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the digit sum for the number 21000? Solution Python natively supports arbitrary-precision integers and arithmetic with as many digits as necessary to perform a...
by Mike | Oct 27, 2018 | Project Euler

Project Euler 20 Problem Statement n! means n × (n − 1) × … × 3 × 2 × 1 Find the digit sum in the number 100! Solution Python natively supports arbitrary-precision integers and arithmetic with as many digits as necessary to perform a calculation. For example,...
by Mike | Oct 29, 2018 | Project Euler

Project Euler 56 Problem Statement Considering natural numbers of the form, ab, where a, b < 100, what is the maximum digit sum for all the powers? For example 187 is 612220032 and the digit sum for this power is 18. Solution Python natively supports...