There is a number formed by n copies of 2020 and 1 in the unit place. If this number is divisible by 17, what is the smallest possible value of n
2,021,202,120,212,021 mod 17 ==0
That is not the right answer.
I used the euclidean algorithm to solve this :
But the answer is only a little so you could start at 1 then work up until you find the answer.