Cody Problem 656 deals with the totient function, denoted by 
which counts the numbers less than n that are relatively prime to n. The first five values of the totient are 1, 1, 2, 2, and 4.
which counts the numbers less than n that are relatively prime to n. The first five values of the totient are 1, 1, 2, 2, and 4. The totient summatory function 
is the sum of the values of 
from 
to n. Therefore, 
.
is the sum of the values of from to n. Therefore, . Write a function to compute the totient summatory function.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers7
Suggested Problems
-
14309 Solvers
-
316 Solvers
-
116 Solvers
-
87 Solvers
-
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
427 Solvers
More from this Author328
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
