Results 1 to 2 of 2

Math Help - last two problems. order relation

  1. #1
    Member
    Joined
    Mar 2006
    Posts
    82

    last two problems. order relation

    1) Let n be a postive integer. Explain why the set A of all integers greater than or equal to -n is well-ordered. (hint: if B is a nonempty subset of A, consider the set C of all integers of the form n + b where b in b)

    2) Determine the number of Boolean subalgebras of P(X) if X is the set {1,2,3,4}. How many have exactly two atomic subsets?


    Thank you so much for all the help from this forum.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member TriKri's Avatar
    Joined
    Nov 2006
    Posts
    357
    Thanks
    1
    1) If the order relation to the set A is < (is it?), A has a least element, namely -n. Also every subset of A has a least element, since no of the elements in A equals any other, hence if a,\ b\ \epsilon\ A, either a < b or b < a, cause A only contains each integer once.

    I hope that was right now!
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. 3rd Order Recurrence Relation
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: April 26th 2011, 03:44 AM
  2. Partial Order Relation help
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: February 11th 2011, 12:29 AM
  3. Second Order Recurrence relation
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: February 12th 2008, 01:59 PM
  4. Order/Relation Question
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 15th 2006, 09:51 AM
  5. Partial order relation
    Posted in the Discrete Math Forum
    Replies: 10
    Last Post: April 17th 2006, 01:34 PM

Search Tags


/mathhelpforum @mathhelpforum