Loading [MathJax]/jax/element/mml/optable/GreekAndCoptic.js

Problem #124

Co-prime judgement

We define φ(n) as the number of positive integers less than or equal to n that are relatively prime to n.

Lets define S(n) = \sum φ(d) over all the divisors of n (i.e. d divides n).

Also define F(n) = \sum S(x) where x varies from 1 to n.

Compute the value of F(999999) + F(888888)

Contributed by Adarsh Kumar

Solved by 128 users

Log in to submit answers.

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.