// archives

Solutions 101 – 150

This category contains 27 posts

Project Euler 101 Solution

Investigate the optimum polynomial function to model the first k terms of a given sequence.

Project Euler 102 Solution

Determine if the origin is contained inside a triangle.

Project Euler 104 Solution

Find Fibonacci numbers for which the first and last nine digits are pandigital.

Project Euler 112 Solution

Investigating the density of “bouncy” numbers.

Project Euler 113 Solution

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

Project Euler 114 Solution

Count the ways a row measuring fifty units in length could be filled with blocks three units long. The blocks must be separated by at least one empty space.

Project Euler 115 Solution

Fill an empty row with blocks, a minimum length of 50 units, until the size of the row exceeds 1,000,000 units. The blocks must be separated by at least one empty space.

Project Euler 116 Solution

Count the number of ways a space 50 units long could be filled by tiles, homogeneously, measuring 2, 3 or 4 units long.

Project Euler 117 Solution

Count the number of ways a space 50 units long could be filled by tiles, heterogeneously, measuring 2, 3 or 4 units long.

Project Euler 119 Solution

Investigating the numbers which are equal to sum of their digits raised to some power.