Hi, is there any forumula to find the sum of square free (Square-free integer - Wikipedia, the free encyclopedia) divisors of an integer?
One way is to get the divisors then check for each if it is square free and take the sum. However is there any formula for calculating it?
I think mobius (Möbius function - Wikipedia, the free encyclopedia) function and Euler-Totient(Euler's totient function - Wikipedia, the free encyclopedia) functions can be used here but am not sure how?
E.g for n = 9 the divisors are 1,3,9 out of which the square free divisors are 1,3 hence sum = 4.