Can I find any question to practice that require the application of euler totient theorem
Thanks in advance
# | 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 |
Can I find any question to practice that require the application of euler totient theorem
Thanks in advance
Name |
---|
Usually the problem related to euler theorem is "given 3 integer A, B, C (can be vary large), find the value of A^B mod C" Such as, UVA 374 and UVA 10692
That's application of Fermat's little theorem, not euler.
Fermat's Little Theorem is a special case of Euler Theorem when $$$n$$$ is prime
Also, we saw a question on Euler Totient in a recent contest in HackerEarth here
Absolutely right ,Fermat's theorem is a special case of euler's but are there problems where direct application of euler's theorem is required.i.e we need to some how use the number of conprimes less than n. Thanks in advance.