Waste less time on Facebook — follow Brilliant.

Prove this by combinatorics

Call \(\varphi(n)\) is an arithmetic function that counts the positive integers less than or equal to \(n\) that are relatively prime to \(n\).

By using combinatorics, prove that : \[\large \sum_{d|n}\varphi (n) =n\]

Note by Rony Phong
2 years, 2 months ago

No vote yet
1 vote


There are no comments in this discussion.


Problem Loading...

Note Loading...

Set Loading...