Do you know Euler's Totient Function? You probably do.

The function \( \phi(n) \) stands for the number of positive integers less than or equal to n that are relatively prime to n.

In this problem, you will receive a list of a list of numbers, and you must answer the value of the sum of Euler's Totient Function for every number in that list. As the sum may be too big, **you must give the answer modulo 1,000,000,007**.

Click here to access the list.

For example, if the list was {3, 5, 7}, your answer should be: \( \phi(3) + \phi(5) + \phi(7) = 2 + 4 + 6 = 12 \)

×

Problem Loading...

Note Loading...

Set Loading...