Add the minimumnumber of ordered pairs to $$S$$ to make it an $$\,\,\,\,\,$$equivalence relation. Give the modified $$S$$.
(b) Let $$S = \left\{ {a,\,\,b} \right\}\,\,\,\,$$ and let ▢ $$S$$ be the power set of $$S$$. Consider the binary relation $$'\underline \subset $$ (set inclusion)' on ▢ $$S$$. Draw the Hasse diagram corresponding to the lattice (▢$$(S)$$, $$\underline \subset $$)
(a) what is the number of multisets of size 4 that can be constructed from n distinct elements so that at least one element occurs exactly twice?
(b) How many multisets can be constructed from n distinct elements?
(a) Prove that $$\left( {0,\,1,\, \otimes } \right)$$ is not a group.
(b) Write $$3$$ distinct groups $$\left( {G,\,\, \otimes } \right)$$ where $$G \subset s$$ and $$G$$ has $$2$$ $$\,\,\,\,\,\,$$elements.
(a) Show that $${G_1}\, \cap \,{G_2}$$ is also a subgroup of $$G$$.
(b) $${\rm I}$$s $${G_1}\, \cup \,{G_2}$$ always a subgroup of $$G$$?
GATE CSE Subjects
Browse all chapters by subject