All Questions
Tagged with elementary-number-theory summation
482
questions
50
votes
4
answers
5k
views
Identity involving Euler's totient function: $\sum \limits_{k=1}^n \left\lfloor \frac{n}{k} \right\rfloor \varphi(k) = \frac{n(n+1)}{2}$
Let $\varphi(n)$ be Euler's totient function, the number of positive integers less than or equal to $n$ and relatively prime to $n$.
Challenge: Prove
$$\sum_{k=1}^n \left\lfloor \frac{n}{k} \right\...
1
vote
1
answer
295
views
Why does this sum mod out to 0?
In making up another problem today I came across something odd. I've been thinking it over and I can't exactly place why it's true, but after running a long Python script to check, I haven't yet found ...