// archives

Python

This tag is associated with 157 posts

Project Euler 47 Solution

Find the first four consecutive integers to have four distinct primes factors.

Project Euler 48 Solution

Find the last ten digits of 1^1 + 2^2 + … + 1000^1000.

Project Euler 49 Solution

Find arithmetic sequences, made of prime terms, whose four digits are permutations of each other.

Project Euler 50 Solution

Find the prime number, below one-million, that can be written as the sum of the most consecutive primes.

Project Euler 51 Solution

Find the smallest prime which, by replacing part of the number with the same digit, is part of an eight prime value set.

Project Euler 52 Solution

Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits in some order.

Project Euler 53 Solution

Count the values of C(n,r), for 1 ≤ n ≤ 100, that exceed one-million.

Project Euler 55 Solution

Find how many Lychrel numbers are there below ten-thousand.

Project Euler 56 Solution

Considering natural numbers of the form, a^b, find the maximum digital sum.

Project Euler 57 Solution

Investigate the expansion of the continued fraction for the square root of two.