// archives

Solutions 101 – 150

This category contains 27 posts

Project Euler 139 Solution

Find how many Pythagorean triangles allow tiling with a perimeter < 100,000,000.

Project Euler 137 Solution

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

Project Euler 138 Solution

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

Project Euler 120 Solution

Finding the maximum remainder when (a āˆ’ 1)n + (a + 1)n is divided by a2.

Project Euler 129 Solution

Investigating minimal repunits that divide by n.

Project Euler 125 Solution

Finding square sums that are palindromic.

Project Euler 130 Solution

Finding composite values, n, for which nāˆ’1 is divisible by the length of the smallest repunits that divide it.

Project Euler 132 Solution

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

Project Euler 133 Solution

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

Project Euler 113 Solution

Count how many numbers below a googol (10**100) are not “bouncy”