Finding square sums that are palindromic.
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.
How many numbers below a googol (10**100) are not “bouncy”?
Investigating the density of “bouncy” numbers.
Finding Fibonacci numbers for which the first and last nine digits are pandigital.
Determining the number of solutions of the equation x**2 ā y**2 ā z**2 = n.
Finding the number of blue discs for which there is 50% chance of taking two blue.