Problem 50182. Compute the Euler totient function
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 commentsProblem Recent Solvers9
Suggested Problems
-
6780 Solvers
-
Get the length of a given vector
10552 Solvers
-
418 Solvers
-
find nth even fibonacci number
65 Solvers
-
43 Solvers
More from this Author269
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!