Personal tools

Euler problems/131 to 140

From HaskellWiki

< Euler problems(Difference between revisions)
Jump to: navigation, search
Line 1: Line 1:
== [http://projecteuler.net/index.php?section=view&id=131 Problem 131] ==
+
Do them on your own!
Determining primes, p, for which n3 + n2p is a perfect cube.
 
 
Solution:
 
 
== [http://projecteuler.net/index.php?section=view&id=132 Problem 132] ==
 
Determining the first forty prime factors of a very large repunit.
 
 
Solution:
 
 
== [http://projecteuler.net/index.php?section=view&id=133 Problem 133] ==
 
Investigating which primes will never divide a repunit containing 10n digits.
 
 
Solution:
 
== [http://projecteuler.net/index.php?section=view&id=134 Problem 134] ==
 
Finding the smallest positive integer related to any pair of consecutive primes.
 
 
Solution:
 
== [http://projecteuler.net/index.php?section=view&id=135 Problem 135] ==
 
Determining the number of solutions of the equation x2 − y2 − z2 = n.
 
 
Solution:
 
== [http://projecteuler.net/index.php?section=view&id=136 Problem 136] ==
 
Discover when the equation x2 − y2 − z2 = n has a unique solution.
 
 
Solution:
 
== [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.
 
 
Solution:
 
== [http://projecteuler.net/index.php?section=view&id=138 Problem 138] ==
 
Investigating isosceles triangle for which the height and base length differ by one.
 
 
Solution:
 
== [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.
 
 
Solution:
 
== [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.
 
 
Solution:
 

Revision as of 21:44, 29 January 2008

Do them on your own!