The Euler totient function
gives the number of integers smaller than n that are relatively prime to n---that is, that share no common factors with n other than 1. For example,
because 1, 5, 7, and 11 share no common factors other than 1. If p is a prime number, then
because all numbers smaller than p are relatively prime to p.
Write a function to compute the Euler totient function.
Note: I now realize that Cody Problem 656 also deals with the totient function. Apologies to Freddy.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers14
Suggested Problems
-
14427 Solvers
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15822 Solvers
-
22049 Solvers
-
Back to basics 6 - Column Vector
1115 Solvers
-
Pattern Recognition 1 - Known Unit Length
75 Solvers
More from this Author330
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!