# Euler problems/101 to 110

### From HaskellWiki

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

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=101 Problem 101] == |

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

Line 8: | Line 8: | ||

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

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

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

Line 16: | Line 16: | ||

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

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

Investigating sets with a special subset sum property. | Investigating sets with a special subset sum property. | ||

Line 24: | Line 24: | ||

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

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

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

Line 32: | Line 32: | ||

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

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

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

Line 40: | Line 40: | ||

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

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

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

Line 48: | Line 48: | ||

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

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

Determining the most efficient way to connect the network. | Determining the most efficient way to connect the network. | ||

Line 56: | Line 56: | ||

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

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

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

Line 64: | Line 64: | ||

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

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

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

Line 72: | Line 72: | ||

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

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

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

## Revision as of 10:28, 20 July 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