Explore BrainMass

Explore BrainMass

    Congruence of Integers (Prove)

    Not what you're looking for? Search our solutions OR ask your own Custom question.

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

    Prove the following:

    Prove that if m is an integer, then either m^2 = 0 ( mod 4) or m^2 =1 (mod 4).
    Hint: Consider that cases where m is even and where m is odd

    © BrainMass Inc. brainmass.com March 4, 2021, 8:11 pm ad1c9bdddf

    Solution Summary

    The solution assists with proving the congruence of integers.