search

ProAlgos / ProAlgos-Cpp

C++ implementations of well-known (and some rare) algorithms, while following good software development practices
MIT License
507 stars 363 forks source link

Euler's Totient #438

Closed omkar-karke closed 1 year ago

omkar-karke commented 1 year ago

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[bot] commented 1 year ago

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.