Personal tools

Euler problems/111 to 120

From HaskellWiki

< Euler problems(Difference between revisions)
Jump to: navigation, search
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=problems&id=111 Problem 111] ==
+
== [http://projecteuler.net/index.php?section=view&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.
   
Line 8: Line 8:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=112 Problem 112] ==
+
== [http://projecteuler.net/index.php?section=view&id=112 Problem 112] ==
 
Investigating the density of "bouncy" numbers.
 
Investigating the density of "bouncy" numbers.
   
Line 16: Line 16:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=113 Problem 113] ==
+
== [http://projecteuler.net/index.php?section=view&id=113 Problem 113] ==
 
How many numbers below a googol (10100) are not "bouncy"?
 
How many numbers below a googol (10100) are not "bouncy"?
   
Line 24: Line 24:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=114 Problem 114] ==
+
== [http://projecteuler.net/index.php?section=view&id=114 Problem 114] ==
 
Investigating the number of ways to fill a row with separated blocks that are at least three units long.
 
Investigating the number of ways to fill a row with separated blocks that are at least three units long.
   
Line 32: Line 32:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=115 Problem 115] ==
+
== [http://projecteuler.net/index.php?section=view&id=115 Problem 115] ==
 
Finding a generalisation for the number of ways to fill a row with separated blocks.
 
Finding a generalisation for the number of ways to fill a row with separated blocks.
   
Line 40: Line 40:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=116 Problem 116] ==
+
== [http://projecteuler.net/index.php?section=view&id=116 Problem 116] ==
 
Investigating the number of ways of replacing square tiles with one of three coloured tiles.
 
Investigating the number of ways of replacing square tiles with one of three coloured tiles.
   
Line 48: Line 48:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=117 Problem 117] ==
+
== [http://projecteuler.net/index.php?section=view&id=117 Problem 117] ==
 
Investigating the number of ways of tiling a row using different-sized tiles.
 
Investigating the number of ways of tiling a row using different-sized tiles.
   
Line 56: Line 56:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=118 Problem 118] ==
+
== [http://projecteuler.net/index.php?section=view&id=118 Problem 118] ==
 
Exploring the number of ways in which sets containing prime elements can be made.
 
Exploring the number of ways in which sets containing prime elements can be made.
   
Line 64: Line 64:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=119 Problem 119] ==
+
== [http://projecteuler.net/index.php?section=view&id=119 Problem 119] ==
 
Investigating the numbers which are equal to sum of their digits raised to some power.
 
Investigating the numbers which are equal to sum of their digits raised to some power.
   
Line 72: Line 72:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=120 Problem 120] ==
+
== [http://projecteuler.net/index.php?section=view&id=120 Problem 120] ==
 
Finding the maximum remainder when (a − 1)n + (a + 1)n is divided by a2.
 
Finding the maximum remainder when (a − 1)n + (a + 1)n is divided by a2.
   

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