Project Euler 133 - Repunit nonfactors
Project Euler 133 - Repunit nonfactors
Official link: https://projecteuler.net/problem=133
Note: I am unhappy with my solution as I just completely brute forced the problem
Thought Process
Thought Process
Same method as Problem 132 to check whether R(10^n) is divisible by a prime. Then I go through each prime less than 100,000 and I check if it divides R(10^n), n = 1 to 100, this way I remove all prime factors I see.
As I said I don't fully get how to do this the smart way, but I figured brute force would work.
Interactive Code
Interactive Code
No interactive code for this one, as I have nothing smart to add, see Problem 132 for essentially the same code