Number TheoryChallengeDivisibility
Divisibility · Challenge problem
A repunit is a number made only of s. What is the smallest number of s a repunit can have if it is divisible by ?
A repunit is a number made only of s. What is the smallest number of s a repunit can have if it is divisible by ?