Difference between revisions of "Euler problems/21 to 30"
Line 77: | Line 77: | ||
<haskell> |
<haskell> |
||
problem_30 = undefined |
problem_30 = undefined |
||
− | </haskell> |
||
− | |||
− | == [http://projecteuler.net/index.php?section=problems&id=31 Problem 31] == |
||
− | Investigating combinations of English currency denominations. |
||
− | |||
− | Solution: |
||
− | <haskell> |
||
− | problem_31 = undefined |
||
</haskell> |
</haskell> |
||
Revision as of 08:20, 27 March 2007
Problem 21
Evaluate the sum of all amicable pairs under 10000.
Solution:
problem_21 = undefined
Problem 22
What is the total of all the name scores in the file of first names?
Solution:
problem_22 = undefined
Problem 23
Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.
Solution:
problem_23 = undefined
Problem 24
What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
Solution:
problem_24 = undefined
Problem 25
What is the first term in the Fibonacci sequence to contain 1000 digits?
Solution:
problem_25 = undefined
Problem 26
Find the value of d < 1000 for which 1/d contains the longest recurring cycle.
Solution:
problem_26 = undefined
Problem 27
Find a quadratic formula that produces the maximum number of primes for consecutive values of n.
Solution:
problem_27 = undefined
Problem 28
What is the sum of both diagonals in a 1001 by 1001 spiral?
Solution:
problem_28 = undefined
Problem 29
How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
Solution:
problem_29 = undefined
Problem 30
Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.
Solution:
problem_30 = undefined