Euler problems/31 to 40

From HaskellWiki
< Euler problems
Revision as of 13:56, 28 March 2007 by Quale (talk | contribs) (fix typo)

Jump to: navigation, search

Problem 31

Investigating combinations of English currency denominations.


problem_31 = undefined

Problem 32

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


problem_32 = undefined

Problem 33

Discover all the fractions with an unorthodox cancelling method.


problem_33 = undefined

Problem 34

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


problem_34 = undefined

Problem 35

How many circular primes are there below one million?


problem_35 = undefined

Problem 36

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


problem_36 = undefined

Problem 37

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


problem_37 = undefined

Problem 38

What is the largest 1 to 9 pandigital that can be formed by multiplying a fixed number by 1, 2, 3, ... ?


problem_38 = undefined

Problem 39

If p is the perimeter of a right angle triangle, {a, b, c}, which value, for p ≤ 1000, has the most solutions?


problem_39 = undefined

Problem 40

Finding the nth digit of the fractional part of the irrational number.


problem_40 = undefined