Problem 60516. Compute the totient summatory function

• Created by ChrisR

×

Like (0)

Difficulty:

(72)

Rate

• Solve Later   
• Add To GroupÂ

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.

The totient summatory function is the sum of the values of from to n. Therefore, .

Write a function to compute the totient summatory function.

Optional: determine the connection between the totient summatory function and the Farey sequence.

Solve

Solution Stats

100.0% Correct | 0.0% Incorrect

• 5 Solutions
• 5 Solvers

Last Solution submitted on Jul 25, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers5

Suggested Problems

• Project Euler: Problem 6, Natural numbers, squares and sums.

  2347 Solvers

• Return area of square

  16164 Solvers

• Flip the bit

  337 Solvers

• Reverse Concatenation

  78 Solvers

• Compute LOG(1+X) in natural log

  253 Solvers

More from this Author298

• Solve an ODE: equation C

  5 Solvers

• Solve the arithmetic differential equation D(n) = n

  11 Solvers

• List modest numbers up to n

  8 Solvers

• Count the ways pairs of parentheses can be matched correctly

  6 Solvers

• Compute a sum of Ramanujan

  13 Solvers