// archives


This tag is associated with 4 posts

Project Euler 129 Solution

Investigating minimal repunits that divide by n.

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.