Enjoyed this more simple problem, nothing too fancy here
This is because of the well known rule that if the denominator (After gcd division) has any prime factor other than 2 or 5, the fraction will repeat.
Implementing this is quite straightforward
Enter a number (yourinput)
Code will output ∑ D(N) for 5 ≤ N ≤ yourinput