The less-than relation, <, on a set of real numbers is              

Related MCQs

• Let a relation R in the set R of real numbers be defined as (a, b) Î R if and only if 1 + ab > 0 for all a, bÎR. The relation R is
• How many numbers must be selected from the set {1, 2, 3, 4} to guarantee that at least one pair of these numbers add up to 7?
• Let R be the set of real numbers. If f : R → R is a function defined by f ( x ) = x2 , then f is]
• The relation R defined on the set of natural numbers as {(a, b): a differs from b by 3} is given
• Let R = { ( 3, 3 ) ( 6, 6 ) ( ( 9, 9 ) ( 12, 12 ), ( 6, 12 ) ( 3, 9 ) ( 3, 12 ), ( 3, 6 ) } be a relation on the set A = { 3, 6, 9, 12 }. The relation is
• Let R = {(3, 3), (6, 6), (9, 9), (12,12), (3,6), (6,3), (3, 9), (9, 3), (9, 12),(12,9)} be a relation on the set A = {3, 6, 9, 12}. The relation is _________
• Let R={(1, 3), (4, 2), (2, 2), (3, 3), (1, 1),(4,4)} be a relation on the set A={1, 2, 3, 4}. The relation R is ____.
• If A is the set of students who play crocket, B is the set of students who play football then the set of students who play either football or cricket, but not both, can be symbolically depicted as the set
• If in sets A, B, C, the set B ∩ C consists of 8 elements, set A ∩ B consists of 7 elements and set C ∩ A consists of 7 elements then the minimum element in set A U B U C will be?
• Let G be a directed graph whose vertex set is the set of numbers from 1 to 50. There is an edge from a vertex i to a vertex j if and only if either j = i + 1 or j = 3i. Calculate the minimum number of edges in a path in G from vertex 1 to vertex 50.