0% found this document useful (0 votes)
16 views2 pages

Summer Discrete

This tutorial sheet for the Discrete Structures course covers topics such as posets, minimal and maximal elements, lattices, and boolean algebra. It includes exercises on drawing Hasse diagrams, finding elements in posets, and exploring properties of various lattices. Additionally, it addresses gcd calculations, linear combinations, modular arithmetic, and the concept of pairwise relatively prime integers.

Uploaded by

NITYAA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views2 pages

Summer Discrete

This tutorial sheet for the Discrete Structures course covers topics such as posets, minimal and maximal elements, lattices, and boolean algebra. It includes exercises on drawing Hasse diagrams, finding elements in posets, and exploring properties of various lattices. Additionally, it addresses gcd calculations, linear combinations, modular arithmetic, and the concept of pairwise relatively prime integers.

Uploaded by

NITYAA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Netaji Subhash University of Technology, Dwarka.

Delhi

Tutorial Sheet 6 (UNIT-3)


Course Name: Discrete Structures Course Code: CMCSC03
Academic Year: 2022-2023 Semester: 2

CO Mapping

Tutorial Sheet Topics CO1 CO2 CO3 CO4 CO5


6 Poset, minimal element, maximal ✓
element, lattice, boolean algebra

Objective: The main objective of this Tutorial sheet is to gain the knowledge about poset,
minimal element, maximal element, lattice, boolean algebra.

1. Draw the Hasse diagram for divisibility on the following set

a){1, 2, 3, 4, 5, 6, 7, 8} b){1, 2, 3, 5, 7, 11, 13} c){1, 2, 3, 6, 12, 24, 36, 48} d){1, 2, 4, 8, 16, 32, 64}.
Also find maximal elements, minimal elements, least element and greatest element if exist.
Is it linearly ordered/ totally ordered set. Moreover, which of the Hasse diagram represent
a lattice.
2. Answer these questions for the poset
({{1}, {2}, {4}, {1, 2}, {1, 4}, {2, 4}, {3, 4}, {1, 3, 4}, {2, 3, 4}}, ⊆).
a) Find the maximal elements. b) Find the minimal elements.
c) Is there a greatest element? d) Is there a least element?
e) Find all upper bounds of {{2}, {4}}.
f) Find the least upper bound of {{2}, {4}}, if it exists.
g) Find all lower bounds of {{1, 3, 4}, {2, 3, 4}}.
h) Find the greatest lower bound of {{1, 3, 4}, {2, 3, 4}}, if it exists.
3. Give two examples of non distributive lattice.
4. Give an example of a lattice which is modular but not distributive.
5. Find the complement of each elements of D42 .
6. Show that D6 and P (S), where S = {1, 2} are isomorphic as a lattice?
7. Define sublattice and give an example of a sublattice.
8. Is Dn is a sublattice of the lattice Z+ under the relation of divisibility?

1
9. Prove that if L be a bounded distributive lattice such that complement of an element exist
then it is unique.
10. Draw the Hasse diagram and which of the following lattice is/are bounded lattice,
distributive lattice, modular lattice, complemented lattice and boolean algebra
a) D20 b) D210 c) D40 d) D75 e) D60 , f )D30 g) D646 .
where Dn be the set of all positive divisor of n.
11. Use the Euclidean algorithm to find

a) gcd(12, 18). b) gcd(111, 201). c) gcd(1001, 1331).


d) gcd(12345, 54321). e) gcd(1000, 5040). f ) gcd(9888, 6060).
12. Express the greatest common divisor of each of these pairs of integers as a linear
combination of these integers.
a) 10, 11 b) 21, 44 c) 36, 48 d) 34, 55 e)117, 213

f ) 0, 223 g)123, 2347 h) 3454, 4666 i) 9999, 11111.


13. Find each of these values.
a) (133mod23 + 261mod23)mod23 b) (457mod23.182mod23)mod23

14. Find each of these values:


a) (992mod32)3mod15 b) (34mod17)2mod11
c) (193mod23)2mod31 d) (893mod79)4mod26.
15. 17. Determine whether the integers in each of these sets are pairwise relatively prime.
a)11, 15, 19 b)14, 15, 21 c)12, 17, 31, 37 d)7, 8, 9, 11

16. Find a div(m) and a mod(m) when


a) a = 228, m = 119 b) a = 9009, m = 223. c) a = 10101, m = 333. d) a = 765432, m = 38271.

17. Prove or disprove that if a|bc, where a, b, and c are positive integers and a ̸= 0, then a|b or
a|c.

You might also like