Investigating which primes will never divide a repunit containing 10**n digits.
Determining the first forty prime factors of a very large repunit.
Finding composite values, n, for which n−1 is divisible by the length of the smallest repunits that divide it.
Investigating minimal repunits that divide by n.
What is the first value which can be written as the sum of primes in over five thousand different ways?
Find arithmetic sequences, made of prime terms, whose four digits are permutations of each other.
What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?
Find the smallest prime which, by changing the same part of the number, can form eight different primes.
What is the value of the first triangle number to have over five hundred divisors?
Find the largest prime factor of a composite number.