# Euler problems/91 to 100

### From HaskellWiki

BrettGiles (Talk | contribs) m |
m (Corrected the links to Project Euler) |
||

Line 1: | Line 1: | ||

[[Category:Programming exercise spoilers]] | [[Category:Programming exercise spoilers]] | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=91 Problem 91] == |

Find the number of right angle triangles in the quadrant. | Find the number of right angle triangles in the quadrant. | ||

Line 8: | Line 8: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=92 Problem 92] == |

Investigating a square digits number chain with a surprising property. | Investigating a square digits number chain with a surprising property. | ||

Line 16: | Line 16: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=93 Problem 93] == |

Using four distinct digits and the rules of arithmetic, find the longest sequence of target numbers. | Using four distinct digits and the rules of arithmetic, find the longest sequence of target numbers. | ||

Line 24: | Line 24: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=94 Problem 94] == |

Investigating almost equilateral triangles with integral sides and area. | Investigating almost equilateral triangles with integral sides and area. | ||

Line 32: | Line 32: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=95 Problem 95] == |

Find the smallest member of the longest amicable chain with no element exceeding one million. | Find the smallest member of the longest amicable chain with no element exceeding one million. | ||

Line 40: | Line 40: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=96 Problem 96] == |

Devise an algorithm for solving Su Doku puzzles. | Devise an algorithm for solving Su Doku puzzles. | ||

Line 48: | Line 48: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=97 Problem 97] == |

Find the last ten digits of the non-Mersenne prime: 28433 × 2<sup>7830457</sup> + 1. | Find the last ten digits of the non-Mersenne prime: 28433 × 2<sup>7830457</sup> + 1. | ||

Line 56: | Line 56: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=98 Problem 98] == |

Investigating words, and their anagrams, which can represent square numbers. | Investigating words, and their anagrams, which can represent square numbers. | ||

Line 64: | Line 64: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=99 Problem 99] == |

Which base/exponent pair in the file has the greatest numerical value? | Which base/exponent pair in the file has the greatest numerical value? | ||

Line 72: | Line 72: | ||

</haskell> | </haskell> | ||

− | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=100 Problem 100] == |

Finding the number of blue discs for which there is 50% chance of taking two blue. | Finding the number of blue discs for which there is 50% chance of taking two blue. | ||

## Revision as of 13:56, 20 July 2007

## Contents |

## 1 Problem 91

Find the number of right angle triangles in the quadrant.

Solution:

problem_91 = undefined

## 2 Problem 92

Investigating a square digits number chain with a surprising property.

Solution:

problem_92 = undefined

## 3 Problem 93

Using four distinct digits and the rules of arithmetic, find the longest sequence of target numbers.

Solution:

problem_93 = undefined

## 4 Problem 94

Investigating almost equilateral triangles with integral sides and area.

Solution:

problem_94 = undefined

## 5 Problem 95

Find the smallest member of the longest amicable chain with no element exceeding one million.

Solution:

problem_95 = undefined

## 6 Problem 96

Devise an algorithm for solving Su Doku puzzles.

Solution:

problem_96 = undefined

## 7 Problem 97

Find the last ten digits of the non-Mersenne prime: 28433 × 2^{7830457} + 1.

Solution:

problem_97 = (28433 * 2^7830457 + 1) `mod` (10^10)

## 8 Problem 98

Investigating words, and their anagrams, which can represent square numbers.

Solution:

problem_98 = undefined

## 9 Problem 99

Which base/exponent pair in the file has the greatest numerical value?

Solution:

problem_99 = undefined

## 10 Problem 100

Finding the number of blue discs for which there is 50% chance of taking two blue.

Solution:

problem_100 = undefined