Dreamshire

Showing what's behind the curtain

// archives

Repunits

This tag is associated with 4 posts

By Mike Molony ⋅ June 15, 2009 ⋅ 2 comments

Investigating minimal repunits that divide by n.

By Mike Molony ⋅ 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.

By Mike Molony ⋅ June 15, 2009 ⋅ Post a comment

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

By Mike Molony ⋅ June 16, 2009 ⋅ 4 comments

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

If you don't build your dream, someone will hire you to build theirs.