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.
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 Solvers12
Suggested Problems
-
1070 Solvers
-
Project Euler: Problem 3, Largest prime factor
1814 Solvers
-
261 Solvers
-
Longest run of consecutive numbers
6636 Solvers
-
Chebyshev polynomials of the 2nd Kind
79 Solvers
More from this Author326
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
