A near-repunit is an integer kRn that has n − 1 digits equal to 1, and a 0 in the k + 1’st place from the right; that is,
Show that if gcd(n − 1 , 3k) > 1, then kRn is composite.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.