Let P(S) denote the power set of set S. which of the is always true

Related MCQs

• Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal elements, and m the number of minimal elements. Which is true?
• Let P(S) denotes the powerset of set S. Which of the following is always true?
• Let N+ denote the nonzero natural numbers. Define a binary relation R on N+ × N+ by (m, n)R(s, t) if gcd(m, n) = gcd(s, t). The binary relation R is
• Let f : X →Y and g : Y → Z. Let h = go f : X → Z. Suppose g is one-to-one and onto. Which of the following is FALSE?
• Let p be “He is tall” and let q “He is handsome”. Then the statement “It is false that he is short or handsome” is:
• If A and B be sets and AC and Bc denote the complements of the sets A and B, then set (A — B) ∪ (B — A) ∪ (A ∩ B) is equal to
• Let A be a finite set. If f : A → A is injective then it is surjective.
• Let R be a relation on a set A = {1, 2, 3, 4} given by R = {(1, 1), (1, 2), (1, 3), (2, 1), (2,2), (2, 3), (3, 1), (3, 2), (3, 3)}. Then the relation is:
• Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are:
• Let S = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21}. What is the smallest integer N > 0 such that for any set of N integers, chosen from S, there must be two distinct integers that divide each other? IZ