Can somebody please explain how to use the Möbius function to solve this problem. https://www.hackerrank.com/contests/w3/challenges/gcd-product
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Can somebody please explain how to use the Möbius function to solve this problem. https://www.hackerrank.com/contests/w3/challenges/gcd-product
Name |
---|
Let f(n,m) denote the number of pairs (x, y), such that x ≤ n, y ≤ m, and gcd(x,y) = 1. WLOG, assume n ≥ m
Using inclusion exclusion,
If we store an array of prefix sums of mobius function, then f(n, m) can be calculated in .
Now let G(g, n, m) be the number of pairs (x, y), such that x ≤ n, y ≤ m, and gcd(x, y) = g.
Clearly, . There are clearly different values of this for all the g's
Our required answer is . Considering the different ranges in which G(g, n, m) is same, this can be calculated in O(n).
Thanks for the nice explanation.
I solved it little differently. After the step
Now I define a function f, such that for any prime p, f(pa) = p else f(n) = 1. It must be noted that
, Now If I substitute this expression in above expression and rearrange the multiplication we get
which reduces to
. Now this is very simple to evaluate.