Scribd
Upload
2 views1 page

Tutorial 1

The document outlines a tutorial for the MTH111: Calculus course at IISER Tirupati, focusing on set theory exercises. It includes problems on set operations, containment relationships, and cardinality, as well as a challenge to generalize a formula for three sets. The tutorial is scheduled for August Session 2025 and includes both standard exercises and an additional thought exercise.

Uploaded by

25f2003227
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
2 views1 page

Tutorial 1

The document outlines a tutorial for the MTH111: Calculus course at IISER Tirupati, focusing on set theory exercises. It includes problems on set operations, containment relationships, and cardinality, as well as a challenge to generalize a formula for three sets. The tutorial is scheduled for August Session 2025 and includes both standard exercises and an additional thought exercise.

Uploaded by

25f2003227
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/ 1

IISER Tirupati August Session 2025

MTH111: Calculus
Tutorial-1 (September 22, 2025)

Exercise 1
(i) What are A ∪ B and A ∩ B if A ⊆ B?
(ii) Give an example where neither of the inclusions A ⊆ B and B ⊆ A holds.
(iii) Find a containment relationship between the sets A \ (A \ B) and B.
(Here A \ B denotes the set difference)

Exercise 2
Suppose A and B are two sets satisfying A ∪ B = ∅. What can you conclude about
the sets A and B? Can you make the same conclusion if instead you have A∩B = ∅?

Exercise 3
For any sets A, B and C prove that A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C).

Exercise 4
For any finite set A, let N (A) denote the number of elements in A. In particular,
N (∅) = 0. Prove the following formula.

N (A ∪ B) = N (A) + N (B) − N (A ∩ B)
Exercise 5
Recall that for any set A, its power set P(A) consists of all subsets of A. Suppose
N (A) = k. What is N (P(A))? Prove your answer.

∗∗∗∗∗∗∗∗∗∗∗∗∗∗∗

An additional exercise to think about (this is not for discussion during the
tutorial):
Can you generalize the formula of Exercise 4 for the case of N (A ∪ B ∪ C)?

You might also like