Monthly Archives: August 2012

Project Euler – Problem 39

Problem 39: If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120.

{20,48,52}, {24,45,51}, {30,40,50}

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

Project Euler – Problem 38

Problem 38: Given the following example:

192 x 1 = 192
192 x 2 = 384
192 x 3 = 576


By concatenating each product we get the 1 to 9 pandigital, 192384576. We will call 192384576 the concatenated product of 192 and (1,2,3)

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?

Project Euler – Problem 37

Problem 37: The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797, 797, 97, and 7. Similarly we can work from right to left: 3797, 379, 37, and 3.

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

Project Euler – Problem 36

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

Project Euler – Problem 35

Problem 35: How many circular primes are there below one million?

Project Euler – Problem 34

Problem 34: Note: 1! + 4! + 5! = 1 + 24 + 120 = 145.

Find the sum of all numbers which are equal to the sum of the factorial of their digits.
Since 1! = 1 and 2! = 2 are not sums they are not included.

Project Euler – Problem 33

Problem 33:
The fraction 49/98 is a curious fraction, as 49/98 = 4/8, obtained by cancelling the 9s.

We shall consider fractions like, 30/50 = 3/5, to be trivial examples.

There are exactly four non-trivial examples of this type of fraction, less than one in value, and containing two digits in the numerator and denominator.

If the product of these four fractions is given in its lowest common terms, find the value of the denominator.

Project Euler – Problem 32

Problem 32: Find the sum of all numbers that can be written as pandigital products.

Project Euler – Problem 31

Problem 31: Given the following coin values: (1p,2p,5p,10p,20p,50p,£1,£2):
Where (1p = 1/£1)
How many different ways can £2 be made using any number of coins?

Project Euler – Problem 30

Problem 30: Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.