Need a proof
\[Prove that \phi(m_1)+\phi(m_2)+...+\phi(m_n)=\gcd(m,n)\]
where m1,m2,...,mn divides both m and n
@ganeshie8
@Kainui
m1, m2,...,mn are positive as well
Hey!
What do u need help in
Your statement in compact form : \[\large a = \sum\limits_{d\mid a} \phi(d)\] Proof : Consider a partition of integers, \(\{1,2,3,\ldots,a\}\) : \[S_d=\{b : \gcd(a,b)=d; 1\le b\le a\}\] Notice that \(\gcd(a,b)=d\iff \gcd(a/d,b/d)=1\). That means \(|S_d| = \phi(a/d)\). Therefore, \[\large a = \sum\limits_{d\mid a} \phi(a/d) = \sum\limits_{d\mid a} \phi(d) \]
Thanks @ganeshie8 .:)
I dont have number theory but I needed a proof to be sure my claim in true, the result I will use in another problem.
np :) that notation isn't hard to understand, let me know if you want the detailed proof
You already gave me in my inbox. And I understood, its nice and easy. Thanks to Gauss.:)
hi @ganeshie8
Heyy
I read the proof of Gauss.
But I dont know how to prove what is given in the question
Join our real-time social learning platform and learn together with your friends!