Results 1 to 2 of 2

Math Help - i do need some help....

  1. #1
    Newbie
    Joined
    Jan 2008
    Posts
    3

    Post i do need some help....

    here's the question and has to do with order and string-series:
    let A be the set of all bit string-series of the size of 11. Let also R be a relation on A where 2 string-series are related iff the 3 first bits are the same.sHOW that R is reflexive,symmetric, and transitive....i hope MY translation from greek to english is not TOO bad...
    thanks in advance
    ps:actually the symbol series will be 8...
    we are interested in only about the 3 first bits
    000.....
    001.....
    010....
    011....
    100....
    101....
    110...
    111...
    we intuitively understand that is reflexive...how we prove...and what aboutsymmetric & transitive....?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,677
    Thanks
    1618
    Awards
    1
    Quote Originally Posted by aegean View Post
    we intuitively understand that is reflexive...how we prove...and what aboutsymmetric & transitive....?
    As I said before, anytime you has the relation defined as “same as” it is easily shown to be an equivalence relation.
    If a has the same first three bits as b then b has the first three bits as a: symmetric.

    If a has the same first three bits as b and b has the same first three bits as c, then clearly a has the same first three bits as c: transitive.
    Follow Math Help Forum on Facebook and Google+


/mathhelpforum @mathhelpforum