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

Related MCQs

• 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 p be “He is tall” and let q “He is handsome”. Then the statement “It is false that he is short or handsome” 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 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) denote the power set of set S. which of the is always true
• If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.
• Define f(n) = n/2 + 1−(−1)n/4 for all n 2 Z. Thus, f: Z → Z, Z the set of all integers.Which is correct?
• The set of even integers is well-ordered.
• The number of distinct relations on a set of 3 elements is
• Fact 1: Jessica has four children Fact 2: Two of the children have blue eyes and two of the children have brown eyes. Fact 3: Half of the children are girls. If the first three statements are facts, which of the following statements must also be a fact? I: At least one girl has blue eyes. II: Two of the children are boys. III: The boys have brown eyes.