Euler Totient function

[knotman90]

What about writing some code for computing the euler totient function?

It is defined as follows:
Given an integer n how many number <n are coprime with it?

It is a very common constant in number theory.

https://en.wikipedia.org/wiki/Euler%27s_totient_function

Would you mind if I submit a PR on this?

[faheel]

@knotman90 Yes, you can definitely submit a PR for this. In fact I was thinking about adding it a few weeks ago but didn't get the time.

You can add the code in a file named EulerTotient.cpp in the NumberTheory folder.

[ankur54]

Is the issue open? I would like to work on it

[knotman90]

@ankur54 I guess you can as I have not performed any action since then.

[ankur54]

Would a normal c++ code suffice or, do I have to code it in .h file?

[alxmjo]

Algorithm implementation goes in header (.hpp) file, unit tests go in .cpp file. Thanks!

[stale]

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.

[faheel]

Since the recent code reorganisation, the code for this should now go in include/algorithm/number_theory/euler_totient.hpp.

[stale]

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.

[naveensaigit]

Can I work on this?

[knotman90]

Yes please. Make a pull request.

…

On Sat, 19 Oct 2019, 19:44 naveensaigit, ***@***.***> wrote: Can I work on this? — You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub <#55>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/ABM5NS7ZA6XBXEFFQJENOP3QPNBPRANCNFSM4DLWFLZA> .