0% found this document useful (0 votes)
4 views1 page

Tutorial 2

The document outlines a tutorial for a computer science course, presenting a series of mathematical problems related to rational and irrational numbers, set theory, and properties of subsets. It includes questions that require proofs or disproofs, demonstrating fundamental concepts in discrete mathematics. The tutorial is dated August 28, 2025, and is designated as Tutorial 2 for the course DISCO - CS F222.
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)
4 views1 page

Tutorial 2

The document outlines a tutorial for a computer science course, presenting a series of mathematical problems related to rational and irrational numbers, set theory, and properties of subsets. It includes questions that require proofs or disproofs, demonstrating fundamental concepts in discrete mathematics. The tutorial is dated August 28, 2025, and is designated as Tutorial 2 for the course DISCO - CS F222.
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

DISCO - CS F222

Tutorial 2
28th August 2025

Q1. Prove or disprove that there is a rational number x and an


irrational number y such that xy is irrational.

Q2. Suppose that there are 5 1’s and 4 0’s arranged around a circle.
You insert a 0 between two equal bits and a 1 between two
unequal bits and erase the original 9 bits.
Prove or disprove whether you can end up in an arrangement
with 9 0’s if you iterate with this procedure.

Q3. Show A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C) using

(a) A membership table

(b) An element argument

Q4. Let A and B be subsets of a universal set U. Show that A ⊆ B


if and only if B ⊆ A.

Q5. Prove A ∩ B = A ∪ B

Q6. Prove that P(A) ⊆ P(B) iff A ⊆ B

You might also like