MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

2 alluding->eluding

Hello,

At for instance, http://en.wikibooks.org/wiki/Famous_Theorems_of_Mathematics/Number_Theory/Totient_Function#Sum_of_integers_relatively_prime_to_and_less_than_or_equal_to_n, there is a closed form for the integers relatively prime and less than an integer n, given by $\displaystyle\sum_{1\leq n\leq k ,gcd(n,k)=1} n =\frac{k \varphi(k)}{2}$,

where $\varphi$ is the Euler totient function. I have spent days looking for a trick on how to write

$\displaystyle\sum_{1\leq n\leq k ,gcd(n,k)=1} n^2$

in some sort of closed form, which would reduce to the easily computed case when k is prime. I have had success in the past in finding closed forms for different sums, but this one keeps alluding eluding me. Any ideas could be greatly appreciated

1

# Sum of integers squared relatively prime to and less than n ???

Hello,

At for instance, http://en.wikibooks.org/wiki/Famous_Theorems_of_Mathematics/Number_Theory/Totient_Function#Sum_of_integers_relatively_prime_to_and_less_than_or_equal_to_n, there is a closed form for the integers relatively prime and less than an integer n, given by $\displaystyle\sum_{1\leq n\leq k ,gcd(n,k)=1} n =\frac{k \varphi(k)}{2}$,

where $\varphi$ is the Euler totient function. I have spent days looking for a trick on how to write

$\displaystyle\sum_{1\leq n\leq k ,gcd(n,k)=1} n^2$

in some sort of closed form, which would reduce to the easily computed case when k is prime. I have had success in the past in finding closed forms for different sums, but this one keeps alluding me. Any ideas could be greatly appreciated