Difference between revisions of "Euler problems/91 to 100"

From HaskellWiki
Jump to: navigation, search
([http://projecteuler.net/index.php?section=problems&id=97 Problem 97]: a solution)
m
Line 1: Line 1:
  +
[[Category:Programming exercise spoilers]]
 
== [http://projecteuler.net/index.php?section=problems&id=91 Problem 91] ==
 
== [http://projecteuler.net/index.php?section=problems&id=91 Problem 91] ==
 
Find the number of right angle triangles in the quadrant.
 
Find the number of right angle triangles in the quadrant.

Revision as of 21:02, 23 June 2007

Problem 91

Find the number of right angle triangles in the quadrant.

Solution:

problem_91 = undefined

Problem 92

Investigating a square digits number chain with a surprising property.

Solution:

problem_92 = undefined

Problem 93

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

Solution:

problem_93 = undefined

Problem 94

Investigating almost equilateral triangles with integral sides and area.

Solution:

problem_94 = undefined

Problem 95

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

Solution:

problem_95 = undefined

Problem 96

Devise an algorithm for solving Su Doku puzzles.

Solution:

problem_96 = undefined

Problem 97

Find the last ten digits of the non-Mersenne prime: 28433 × 27830457 + 1.

Solution:

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

Problem 98

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

Solution:

problem_98 = undefined

Problem 99

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

Solution:

problem_99 = undefined

Problem 100

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

Solution:

problem_100 = undefined