// archives

Repunits

This tag is associated with 4 posts

Project Euler Problem 133 Solution

By Mike ⋅ June 16, 2009 ⋅ One comment

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

Project Euler Problem 132 Solution

By Mike ⋅ June 15, 2009 ⋅ 4 comments

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

Project Euler Problem 130 Solution

By Mike ⋅ June 15, 2009 ⋅ Post a comment

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

Project Euler Problem 129 Solution

By Mike ⋅ June 15, 2009 ⋅ One comment

Investigating minimal repunits that divide by n.

—

Most Emailed