Euler problems/91 to 100
m (EulerProblems/91 to 100 moved to Euler problems/91 to 100)
(→[http://projecteuler.net/index.php?section=problems&id=97 Problem 97]: a solution)
Revision as of 19:56, 2 April 2007
Find the number of right angle triangles in the quadrant.
problem_91 = undefined
Investigating a square digits number chain with a surprising property.
problem_92 = undefined
Using four distinct digits and the rules of arithmetic, find the longest sequence of target numbers.
problem_93 = undefined
Investigating almost equilateral triangles with integral sides and area.
problem_94 = undefined
Find the smallest member of the longest amicable chain with no element exceeding one million.
problem_95 = undefined
Devise an algorithm for solving Su Doku puzzles.
problem_96 = undefined
Find the last ten digits of the non-Mersenne prime: 28433 × 27830457 + 1.
problem_97 = (28433 * 2^7830457 + 1) `mod` (10^10)
Investigating words, and their anagrams, which can represent square numbers.
problem_98 = undefined
Which base/exponent pair in the file has the greatest numerical value?
problem_99 = undefined
10 Problem 100
Finding the number of blue discs for which there is 50% chance of taking two blue.
problem_100 = undefined