Problem 60516. Compute the totient summatory function

• Created by ChrisR

×

Like (0)

Difficulty:

(3)

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

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers5

Suggested Problems

• Whether the input is vector?

  9532 Solvers

• Is it an Armstrong number?

  328 Solvers

• Split bread like the Pharaohs - Egyptian fractions and greedy algorithm

  80 Solvers

• Convert a vector of Integers into a matrix of binaries

  79 Solvers

• compress sequence into intervals

  90 Solvers

More from this Author292

• Describe n from right to left

  7 Solvers

• Find the nth Fibbinary number

  11 Solvers

• Compute the arithmetic derivative of integers

  25 Solvers

• Find the smallest integer m such that n divides m!

  15 Solvers

• Determine whether a number is a Gaussian prime

  7 Solvers