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
-
254 Solvers
-
403 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
1720 Solvers
-
Create an index-powered vector
719 Solvers
-
Count the primes in Collatz sequences
14 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!