Explore BrainMass
Share

Explore BrainMass

    Euler's theorem proof

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Consider Euler's theorem:
    If m is a positive integer and a is an integer relatively prime to m, then a^phi(m)≡1(mod m)

    Use this theorem to show that if a is an integer relatively prime to 32760 then a^12≡1(mod 32760).

    Symbols better shown in file (attached).

    © BrainMass Inc. brainmass.com October 9, 2019, 6:16 pm ad1c9bdddf
    https://brainmass.com/math/discrete-math/euler-s-theorem-proof-83522

    Attachments

    Solution Summary

    This shows how to use Euler's theorem in a proof.

    $2.19