Euler problems/131 to 140
m (EulerProblems/131 to 140 moved to Euler problems/131 to 140)
Revision as of 21:04, 23 June 2007
Determining primes, p, for which n3 + n2p is a perfect cube.
problem_131 = undefined
Determining the first forty prime factors of a very large repunit.
problem_132 = undefined
Investigating which primes will never divide a repunit containing 10n digits.
problem_133 = undefined
Finding the smallest positive integer related to any pair of consecutive primes.
problem_134 = undefined
Determining the number of solutions of the equation x2 − y2 − z2 = n.
problem_135 = undefined
Discover when the equation x2 − y2 − z2 = n has a unique solution.
problem_136 = undefined
Determining the value of infinite polynomial series for which the coefficients are Fibonacci numbers.
problem_137 = undefined
Investigating isosceles triangle for which the height and base length differ by one.
problem_138 = undefined
Finding Pythagorean triangles which allow the square on the hypotenuse square to be tiled.
problem_139 = undefined
10 Problem 140
Investigating the value of infinite polynomial series for which the coefficients are a linear second order recurrence relation.
problem_140 = undefined