Results 1 to 5 of 5
Like Tree1Thanks
  • 1 Post By Siron

Thread: Equivalence relation - Congruence modulo

  1. #1
    Junior Member
    Joined
    Nov 2012
    From
    Manchester
    Posts
    30

    Equivalence relation - Congruence modulo

    Equivalence relation - Congruence modulo-probmath-jpeg.jpg
    Last edited by aprilrocks92; Nov 12th 2012 at 11:30 PM.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor Siron's Avatar
    Joined
    Jul 2011
    From
    Belgium
    Posts
    1,254
    Thanks
    24

    Re: Equivalence relation - Congruence modulo

    What have you tried so far? You should prove by definition that the given relation is reflexive, symmetric and transitive. Can you do that?
    Thanks from aprilrocks92
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Junior Member
    Joined
    Nov 2012
    From
    Manchester
    Posts
    30

    Re: Equivalence relation - Congruence modulo

    Thank you. I am familiar with the properties reflexive, symmetric and transitive, but not when it comes to modulo. I have never seen it before, and simply do not know where to start.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor Siron's Avatar
    Joined
    Jul 2011
    From
    Belgium
    Posts
    1,254
    Thanks
    24

    Re: Equivalence relation - Congruence modulo

    The relation \equiv_5 is defined as \forall x,y \in \mathbb{S}_7: x\equiv_5 y \Leftrightarrow x \mod 5 = y \mod 5
    To check if the relation is reflexive you have to check \forall x \in \mathbb{S}_7: x \equiv_5 x which is true because x \mod 5 = x \mod 5.

    Can you check the symmetric and transitive property now?
    Follow Math Help Forum on Facebook and Google+

  5. #5
    MHF Contributor

    Joined
    Aug 2006
    Posts
    20,418
    Thanks
    2305
    Awards
    1

    Re: Equivalence relation - Congruence modulo

    Quote Originally Posted by aprilrocks92 View Post
    Click image for larger version. 

Name:	probMath-jpeg.jpg 
Views:	15 
Size:	22.9 KB 
ID:	25686
    I have a different but equidistant way of describing that relation.
    Say x\mathcal{R}y if and only if x~\&~y have the same remainder when divided by 5

    Thus it should be clear that 2\mathcal{R}7.

    The three needed properties are easily checked.

    There are five equivalence classes.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. congruence modulo
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: May 20th 2012, 07:06 AM
  2. Replies: 1
    Last Post: Apr 7th 2011, 12:46 AM
  3. Congruence modulo and equivalence classes
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Apr 9th 2010, 06:28 AM
  4. congruence modulo 2^n
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: Nov 3rd 2009, 07:47 PM
  5. Equivalence relation and order of each equivalence class
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Sep 30th 2009, 10:03 AM

Search Tags


/mathhelpforum @mathhelpforum