Project Euler Solution 30: Digit fifth powers
Problem 30: Digit fifth powers is a nice one because there are two parts to it.
Einträge über Project Euler (Ältere Einträge, Seite 3)
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.
Project Euler Solution 28: Number spiral diagonals
In Project Euler Problem 28: Number spiral diagonals one has to sum up the diagonals of a number spiral.
Project Euler Solution 27: Quadratic primes
Problem 27: Quadratic primes of the Project Euler series is again about prime numbers.
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.
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.
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.
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.
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.
Project Euler Solution 21: Amicable numbers
This is part of the Project Euler series, this is about Problem 21: Amicable numbers. It is about numbers where the sum of the proper divisors of the sum of the proper divisors is the number itself.