When submitting a solution in C++, please select either C++14 (GCC 6-32) or C++17 (GCC 7-32) as your compiler. ×

jaigurudev's blog

By jaigurudev, 9 years ago, In English

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

Thanks in advance

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it +2 Vote: I do not like it

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

  • »
    »
    4 years ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    That's application of Fermat's little theorem, not euler.

    • »
      »
      »
      4 years ago, # ^ |
      Rev. 2   Vote: I like it +3 Vote: I do not like it

      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

      • »
        »
        »
        »
        4 years ago, # ^ |
        Rev. 2   Vote: I like it 0 Vote: I do not like it

        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.