Euler's Totient
omkar-karke opened this issue · 1 comments
omkar-karke commented
Euler's totient function (a.k.a. phi function) counts the number of positive integers from 1 to given number N that are coprime to N. That is, phi(N) is a number of positive integer m such that 1 <= m <= N and GCD(m, N) = 1.
This is my first issue in opensource contribution
Consider this as a contribution under hacktoberfest 2022.
stale commented
This issue has been automatically marked as inactive because it has not had recent activity. It will be closed in 15 days if no further activity occurs. Thank you for your contributions.