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
-
Project Euler: Problem 5, Smallest multiple
1648 Solvers
-
What is the distance from point P(x,y) to the line Ax + By + C = 0?
554 Solvers
-
Back to basics 25 - Valid variable names
336 Solvers
-
Rotate and display numbered tile
377 Solvers
-
Integer Sequence - II : New Fibonacci
676 Solvers
More from this Author321
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
