Euler problems/121 to 130
From HaskellWiki
< Euler problems(Difference between revisions)
BrettGiles (Talk | contribs) m |
m (Corrected the 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=121 Problem 121] == |
Investigate the game of chance involving coloured discs. | Investigate the game of chance involving coloured discs. | ||
| Line 8: | Line 8: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=122 Problem 122] == |
Finding the most efficient exponentiation method. | Finding the most efficient exponentiation method. | ||
| Line 16: | Line 16: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=123 Problem 123] == |
Determining the remainder when (pn − 1)n + (pn + 1)n is divided by pn2. | Determining the remainder when (pn − 1)n + (pn + 1)n is divided by pn2. | ||
| Line 24: | Line 24: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=124 Problem 124] == |
Determining the kth element of the sorted radical function. | Determining the kth element of the sorted radical function. | ||
| Line 32: | Line 32: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=125 Problem 125] == |
Finding square sums that are palindromic. | Finding square sums that are palindromic. | ||
| Line 40: | Line 40: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=126 Problem 126] == |
Exploring the number of cubes required to cover every visible face on a cuboid. | Exploring the number of cubes required to cover every visible face on a cuboid. | ||
| Line 48: | Line 48: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=127 Problem 127] == |
Investigating the number of abc-hits below a given limit. | Investigating the number of abc-hits below a given limit. | ||
| Line 56: | Line 56: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=128 Problem 128] == |
Which tiles in the hexagonal arrangement have prime differences with neighbours? | Which tiles in the hexagonal arrangement have prime differences with neighbours? | ||
| Line 64: | Line 64: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=129 Problem 129] == |
Investigating minimal repunits that divide by n. | Investigating minimal repunits that divide by n. | ||
| Line 72: | Line 72: | ||
</haskell> | </haskell> | ||
| − | == [http://projecteuler.net/index.php?section= | + | == [http://projecteuler.net/index.php?section=view&id=130 Problem 130] == |
Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it. | Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it. | ||
Revision as of 10:31, 20 July 2007
Contents |
1 Problem 121
Investigate the game of chance involving coloured discs.
Solution:
problem_121 = undefined
2 Problem 122
Finding the most efficient exponentiation method.
Solution:
problem_122 = undefined
3 Problem 123
Determining the remainder when (pn − 1)n + (pn + 1)n is divided by pn2.
Solution:
problem_123 = undefined
4 Problem 124
Determining the kth element of the sorted radical function.
Solution:
problem_124 = undefined
5 Problem 125
Finding square sums that are palindromic.
Solution:
problem_125 = undefined
6 Problem 126
Exploring the number of cubes required to cover every visible face on a cuboid.
Solution:
problem_126 = undefined
7 Problem 127
Investigating the number of abc-hits below a given limit.
Solution:
problem_127 = undefined
8 Problem 128
Which tiles in the hexagonal arrangement have prime differences with neighbours?
Solution:
problem_128 = undefined
9 Problem 129
Investigating minimal repunits that divide by n.
Solution:
problem_129 = undefined
10 Problem 130
Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it.
Solution:
problem_130 = undefined
