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
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
513 Solvers
-
Sum the elements in either diagonal of a square matrix
221 Solvers
-
There are 10 types of people in the world
1282 Solvers
-
71 Solvers
-
Easy Sequences 2: Trigonometric function with integral input and output
42 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!
