# Euler problems/111 to 120

### From HaskellWiki

BrettGiles (Talk | contribs) m (EulerProblems/111 to 120 moved to Euler problems/111 to 120) |
BrettGiles (Talk | contribs) m |
||

Line 1: | Line 1: | ||

+ | [[Category:Programming exercise spoilers]] | ||

== [http://projecteuler.net/index.php?section=problems&id=111 Problem 111] == | == [http://projecteuler.net/index.php?section=problems&id=111 Problem 111] == | ||

Search for 10-digit primes containing the maximum number of repeated digits. | Search for 10-digit primes containing the maximum number of repeated digits. |

## Revision as of 21:03, 23 June 2007

## Contents |

## 1 Problem 111

Search for 10-digit primes containing the maximum number of repeated digits.

Solution:

problem_111 = undefined

## 2 Problem 112

Investigating the density of "bouncy" numbers.

Solution:

problem_112 = undefined

## 3 Problem 113

How many numbers below a googol (10100) are not "bouncy"?

Solution:

problem_113 = undefined

## 4 Problem 114

Investigating the number of ways to fill a row with separated blocks that are at least three units long.

Solution:

problem_114 = undefined

## 5 Problem 115

Finding a generalisation for the number of ways to fill a row with separated blocks.

Solution:

problem_115 = undefined

## 6 Problem 116

Investigating the number of ways of replacing square tiles with one of three coloured tiles.

Solution:

problem_116 = undefined

## 7 Problem 117

Investigating the number of ways of tiling a row using different-sized tiles.

Solution:

problem_117 = undefined

## 8 Problem 118

Exploring the number of ways in which sets containing prime elements can be made.

Solution:

problem_118 = undefined

## 9 Problem 119

Investigating the numbers which are equal to sum of their digits raised to some power.

Solution:

problem_119 = undefined

## 10 Problem 120

Finding the maximum remainder when (a − 1)n + (a + 1)n is divided by a2.

Solution:

problem_120 = undefined