Project Euler Solution 31: Coin sums
In Problem 31: Coin sums of the Project Euler series we have another nice one with permutations and partitioning.
In Problem 31: Coin sums of the Project Euler series we have another nice one with permutations and partitioning.
Problem 30: Digit fifth powers is a nice one because there are two parts to it.
Project Euler Problem 29: Distinct powers we have to work with large integers. This is trivial in Python, so this problem can be solved with a single line without any insights.
In Project Euler Problem 28: Number spiral diagonals one has to sum up the diagonals of a number spiral.
Problem 27: Quadratic primes of the Project Euler series is again about prime numbers.
The next entry in the Project Euler series ist Problem 26: Reciprocal cycles, where we have to use long division to find the cycles in the digits.
In today's installment of the Project Euler series we have Problem 25: 1000-digit Fibonacci number, where we have to find the Fibonacci number with 1000 digits.
Today I have Problem 24 as part of the Project Euler series. It is about permutations and I'll use the itertools library to solve it in four lines.
In today's installment of the Project Euler series we have Problem 23: Non-abundant sums which is again about divisors.
Problem 21: Names scores is one where one doesn't need mathematical insight and implement some parsing and string manipulation.