# 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.

Weiterlesen…

# Project Euler Solution 29: Distinct powers

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.

Weiterlesen…

# Project Euler Solution 26: Reciprocal cycles

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.

Weiterlesen…

# Project Euler Solution 25: 1000-digit Fibonacci number

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.

Weiterlesen…

# Project Euler Solution 24: Lexicographic permutations

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.

Weiterlesen…

# Project Euler Solution 23: Non-abundant sums

In today's installment of the Project Euler series we have Problem 23: Non-abundant sums which is again about divisors.

Weiterlesen…

# Project Euler Solution 22: Names scores

Problem 21: Names scores is one where one doesn't need mathematical insight and implement some parsing and string manipulation.

Weiterlesen…