Euler's Totient function

nilshah98 commented 5 years ago

Do the checklist before filing the issue:

[x] Do you have Node.js and all the relevant dev-dependencies installed?
[ ] Is this a bug fix?
[ ] Is this an enhancement?
[x] Is this a feature request?

NOTE: Provide a clear and concise description of the feature that needs to be added! Or if its a bug, then provide the necessary steps to reproduce it along with screenshots.

Euler’s Totient function for an input n is the count of numbers in {1, 2, 3, …, n} that are relatively prime to n, i.e., the numbers whose GCD (Greatest Common Divisor) with n is 1.

M.phi(6) = 2

M.phi(2.215)        //Error floats not allowed
M.phi(-2)             //Error negative numbers not allowed
M.phi("1")            //Error strings not allowed
M.phi(False)         //Error boolean not allowed

The following function has many applications, especially in RSA algorithm.

Links- Euler's Totient GFG

Implement the algorithm listed at the end, in the above link, since it is more efficient