Consider the ordering relation a | b N x N over natural numbers N su – McqOptions

MCQOPTIONS

1.	Consider the ordering relation a \| b N x N over natural numbers N such that a \| b if there exists c belong to N such that a*c=b. Then ___________
A.	\| is an equivalence relation
B.	It is a total order
C.	Every subset of N has an upper bound under \|
D.	(N,\|) is a lattice but not a complete lattice
Answer» E.

Discussion

No Comment Found

Related MCQs

Let (A, ) be a partial order with two minimal elements a, b and a maximum element c. Let P:A > {True, False} be a predicate defined on A. Suppose that P(a) = True, P(b) = False and P(a) P(b) for all satisfying a b, where stands for logical implication. Which of the following statements cannot be true?
A partial order is defined on the set S = {x, b1, b2, bn, y} as x bi for all i and bi y for all i, where n 1. The number of total orders on the set S which contain the partial order is ______
Consider the ordering relation a | b N x N over natural numbers N such that a | b if there exists c belong to N such that a*c=b. Then ___________
A partial order P is defined on the set of natural numbers as follows. Here a/b denotes integer division. i)(0, 0) P. ii)(a, b) P if and only if a % 10 b % 10 and (a/10, b/10) P. Consider the following ordered pairs:i. (101, 22) ii. (22, 101) iii. (145, 265) iv. (0, 153)
Suppose X = {a, b, c, d} and 1 is the partition of X, 1 = {{a, b, c}, d}. The number of ordered pairs of the equivalence relations induced by __________
The less-than relation, <, on a set of real numbers is ______
Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of edges in the Hasse diagram of is ______