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 relationb) It is a total orderc) Every subset of N has an upper bound under |d) (N,

Every subset of N has an upper bound under |

(N,|) is a lattice but not a complete lattice

Consider the ordering relation a | b ⊆ N x N over natural numbers N

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 relationb) It is a total orderc) Every subset of N has an upper bound under \|d) (N,
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

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) | is an equivalence relationb) It is a total orderc) Every subset of N has an upper bound under |d) (N,
The inclusion of ______ sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial order defined by set containment.
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)The ordered pairs of natural numbers are contained in P are ______ and ______
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 __________
If the longest chain in a partial order is of length l, then the partial order can be written as _____ disjoint antichains.
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 ______

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 relationb) It is a total orderc) Every subset of N has an upper bound under |d) (N,

Discussion

No Comment Found

Related MCQs

Reply to Comment