Personal tools

Euler problems/131 to 140

From HaskellWiki

< Euler problems(Difference between revisions)
Jump to: navigation, search
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=problems&id=131 Problem 131] ==
+
== [http://projecteuler.net/index.php?section=view&id=131 Problem 131] ==
 
Determining primes, p, for which n3 + n2p is a perfect cube.
 
Determining primes, p, for which n3 + n2p is a perfect cube.
   
Line 8: Line 8:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=132 Problem 132] ==
+
== [http://projecteuler.net/index.php?section=view&id=132 Problem 132] ==
 
Determining the first forty prime factors of a very large repunit.
 
Determining the first forty prime factors of a very large repunit.
   
Line 16: Line 16:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=133 Problem 133] ==
+
== [http://projecteuler.net/index.php?section=view&id=133 Problem 133] ==
 
Investigating which primes will never divide a repunit containing 10n digits.
 
Investigating which primes will never divide a repunit containing 10n digits.
   
Line 24: Line 24:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=134 Problem 134] ==
+
== [http://projecteuler.net/index.php?section=view&id=134 Problem 134] ==
 
Finding the smallest positive integer related to any pair of consecutive primes.
 
Finding the smallest positive integer related to any pair of consecutive primes.
   
Line 32: Line 32:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=135 Problem 135] ==
+
== [http://projecteuler.net/index.php?section=view&id=135 Problem 135] ==
 
Determining the number of solutions of the equation x2 − y2 − z2 = n.
 
Determining the number of solutions of the equation x2 − y2 − z2 = n.
   
Line 40: Line 40:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=136 Problem 136] ==
+
== [http://projecteuler.net/index.php?section=view&id=136 Problem 136] ==
 
Discover when the equation x2 − y2 − z2 = n has a unique solution.
 
Discover when the equation x2 − y2 − z2 = n has a unique solution.
   
Line 48: Line 48:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=137 Problem 137] ==
+
== [http://projecteuler.net/index.php?section=view&id=137 Problem 137] ==
 
Determining the value of infinite polynomial series for which the coefficients are Fibonacci numbers.
 
Determining the value of infinite polynomial series for which the coefficients are Fibonacci numbers.
   
Line 56: Line 56:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=138 Problem 138] ==
+
== [http://projecteuler.net/index.php?section=view&id=138 Problem 138] ==
 
Investigating isosceles triangle for which the height and base length differ by one.
 
Investigating isosceles triangle for which the height and base length differ by one.
   
Line 64: Line 64:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=139 Problem 139] ==
+
== [http://projecteuler.net/index.php?section=view&id=139 Problem 139] ==
 
Finding Pythagorean triangles which allow the square on the hypotenuse square to be tiled.
 
Finding Pythagorean triangles which allow the square on the hypotenuse square to be tiled.
   
Line 72: Line 72:
 
</haskell>
 
</haskell>
   
== [http://projecteuler.net/index.php?section=problems&id=140 Problem 140] ==
+
== [http://projecteuler.net/index.php?section=view&id=140 Problem 140] ==
 
Investigating the value of infinite polynomial series for which the coefficients are a linear second order recurrence relation.
 
Investigating the value of infinite polynomial series for which the coefficients are a linear second order recurrence relation.
   

Revision as of 10:32, 20 July 2007

Contents

1 Problem 131

Determining primes, p, for which n3 + n2p is a perfect cube.

Solution:

problem_131 = undefined

2 Problem 132

Determining the first forty prime factors of a very large repunit.

Solution:

problem_132 = undefined

3 Problem 133

Investigating which primes will never divide a repunit containing 10n digits.

Solution:

problem_133 = undefined

4 Problem 134

Finding the smallest positive integer related to any pair of consecutive primes.

Solution:

problem_134 = undefined

5 Problem 135

Determining the number of solutions of the equation x2 − y2 − z2 = n.

Solution:

problem_135 = undefined

6 Problem 136

Discover when the equation x2 − y2 − z2 = n has a unique solution.

Solution:

problem_136 = undefined

7 Problem 137

Determining the value of infinite polynomial series for which the coefficients are Fibonacci numbers.

Solution:

problem_137 = undefined

8 Problem 138

Investigating isosceles triangle for which the height and base length differ by one.

Solution:

problem_138 = undefined

9 Problem 139

Finding Pythagorean triangles which allow the square on the hypotenuse square to be tiled.

Solution:

problem_139 = undefined

10 Problem 140

Investigating the value of infinite polynomial series for which the coefficients are a linear second order recurrence relation.

Solution:

problem_140 = undefined