View source for Euler problems/41 to 50

== [http://projecteuler.net/index.php?section=problems&id=41 Problem 41] ==
What is the largest n-digit pandigital prime that exists?

Solution:
<haskell>
problem_41 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=42 Problem 42] ==
How many triangle words can you make using the list of common English words?

Solution:
<haskell>
problem_42 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=43 Problem 43] ==
Find the sum of all pandigital numbers with an unusual sub-string divisibility property.

Solution:
<haskell>
problem_43 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=44 Problem 44] ==
Find the smallest pair of pentagonal numbers whose sum and difference is pentagonal.

Solution:
<haskell>
problem_44 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=45 Problem 45] ==
After 40755, what is the next triangle number that is also pentagonal and hexagonal?

Solution:
<haskell>
problem_45 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=46 Problem 46] ==
What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?

Solution:
<haskell>
problem_46 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=47 Problem 47] ==
Find the first four consecutive integers to have four distinct primes factors.

Solution:
<haskell>
problem_47 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=48 Problem 48] ==
Find the last ten digits of 11 + 22 + ... + 10001000.

Solution:
<haskell>
problem_48 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=49 Problem 49] ==
Find arithmetic sequences, made of prime terms, whose four digits are permutations of each other.

Solution:
<haskell>
problem_49 = undefined
</haskell>

== [http://projecteuler.net/index.php?section=problems&id=50 Problem 50] ==
Which prime, below one-million, can be written as the sum of the most consecutive primes?

Solution:
<haskell>
problem_50 = undefined
</haskell>

[[Category:Tutorials]]
[[Category:Code]]