# Euler problems/101 to 110

### From HaskellWiki

BrettGiles (Talk | contribs) m (EulerProblems/101 to 110 moved to Euler problems/101 to 110) |

## Revision as of 00:25, 29 March 2007

## Contents |

## 1 Problem 101

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

Solution:

problem_101 = undefined

## 2 Problem 102

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

Solution:

problem_102 = undefined

## 3 Problem 103

Investigating sets with a special subset sum property.

Solution:

problem_103 = undefined

## 4 Problem 104

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

Solution:

problem_104 = undefined

## 5 Problem 105

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

Solution:

problem_105 = undefined

## 6 Problem 106

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

Solution:

problem_106 = undefined

## 7 Problem 107

Determining the most efficient way to connect the network.

Solution:

problem_107 = undefined

## 8 Problem 108

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

Solution:

problem_108 = undefined

## 9 Problem 109

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

Solution:

problem_109 = undefined

## 10 Problem 110

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

Solution:

problem_110 = undefined