euler.euler031

concat-product

(concat-product n upper)

digit-of-decimal-fraction

(digit-of-decimal-fraction n)

integer-right-triangles

(integer-right-triangles n)

p031

(p031)(p031 n coins)

Task: How many different ways can £2 be made using any number of coins?

p032

(p032)

Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.

p033

(p033)

Find the denominator of the four non-trivial examples.

p034

(p034)

Find the sum of all numbers which are equal to the sum of the factorial of their digits.

p035

(p035)

How many circular primes are there below one million?

p036

(p036)

Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.

p037

(p037)

Find the sum of the only eleven primes that are both truncatable from left to right and right to left.

p038

(p038)

What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, … , n) where n > 1?

p039

(p039 n)

For which value of p ≤ 1000, is the number of solutions maximised?

p040

(p040)

Find the value of the expression d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000.