Hi!
How to solve the following problem: https://www.hackerearth.com/problem/algorithm/hanumant-and-his-love/description/
The problem asks to solve the following summation:
where p is a prime and φ(m) is the Euler totient function.
Thanks!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Hi!
How to solve the following problem: https://www.hackerearth.com/problem/algorithm/hanumant-and-his-love/description/
The problem asks to solve the following summation:
where p is a prime and φ(m) is the Euler totient function.
Thanks!
Name |
---|
This can help you: φ(x) is multiplicative function so, φ(pj) = φ(p) * φ(j) = (p - 1) * φ(j)
I'm not sure about solution, but I think this will be used in solution.
Use the following identity:
For a particular p it turns out the summation is of the form:
where
What does "d" refer to in F(n), and could you please explain the proof for function F(n)?
Can you please show how do you simplify the summation for particular p? Thanks!