Processing math: 100%

Problem #131

Crazy sum

Let f ( n ) = \sum_{ d | n } \mu ( d ) h ( n / d ) where h ( x ) = Sum of divisors of x

g ( n ) = \sum_{ d | n } \mu ( d ) f ( n / d )

Find S=\sum_{ n = 1 }^{10000000000} g ( n ) modulo 2^{64}

Note: here \mu ( n ) is Mobius Function.

Contributed by Saharsh Luthra

Solved by 29 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.