Euler problems/101 to 110

From HaskellWiki
< Euler problems
Revision as of 12:13, 30 September 2007 by YitzGale (talk | contribs) (Removing category tags. See Talk:Euler_problems)
Jump to navigation Jump to search

Problem 101

Investigate the optimum polynomial function to model the first k terms of a given sequence.


problem_101 = undefined

Problem 102

For how many triangles in the text file does the interior contain the origin?


problem_102 = undefined

Problem 103

Investigating sets with a special subset sum property.


problem_103 = undefined

Problem 104

Finding Fibonacci numbers for which the first and last nine digits are pandigital.


problem_104 = undefined

Problem 105

Find the sum of the special sum sets in the file.


problem_105 = undefined

Problem 106

Find the minimum number of comparisons needed to identify special sum sets.


problem_106 = undefined

Problem 107

Determining the most efficient way to connect the network.


problem_107 = undefined

Problem 108

Solving the Diophantine equation 1/x + 1/y = 1/n.


problem_108 = undefined

Problem 109

How many distinct ways can a player checkout in the game of darts with a score of less than 100?


problem_109 = undefined

Problem 110

Find an efficient algorithm to analyse the number of solutions of the equation 1/x + 1/y = 1/n.


problem_110 = undefined