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 Solvers11
Suggested Problems
-
Remove the polynomials that have positive real elements of their roots.
1743 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1394 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
458 Solvers
-
97 Solvers
-
Easy Sequences 2: Trigonometric function with integral input and output
43 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
