This question already has an answer here:
Let $n$ be a positive integer which is not divisible by $2$ and $5. $ Prove that there is a multiple of $n$ consisting entirely of ones.
This problem possibly is a duplicate, and I am using the android app in which I don't know how to find existing questions.
I think this can be solved by using Fermat's Little Theorem.
Any help will be appreciated