Can I find any question to practice that require the application of euler totient theorem

Thanks in advance

# | User | Rating |
---|---|---|

1 | MiFaFaOvO | 3681 |

2 | Um_nik | 3544 |

3 | maroonrk | 3431 |

4 | tourist | 3409 |

5 | apiadu | 3397 |

6 | 300iq | 3317 |

7 | ecnerwala | 3260 |

7 | Benq | 3260 |

9 | LHiC | 3229 |

10 | TLE | 3223 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 194 |

2 | antontrygubO_o | 191 |

3 | vovuh | 178 |

4 | pikmike | 177 |

5 | tourist | 166 |

6 | Um_nik | 165 |

7 | McDic | 164 |

8 | ko_osaga | 163 |

9 | Radewoosh | 162 |

10 | 300iq | 156 |

Can I find any question to practice that require the application of euler totient theorem

Thanks in advance

↑

↓

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/29/2020 19:48:04 (h2).

Desktop version, switch to mobile version.

Supported by

User lists

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 10692That'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.