Download Quiz 1 - NISER

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

History of the function concept wikipedia , lookup

Georg Cantor's first set theory article wikipedia , lookup

Infinity wikipedia , lookup

Large numbers wikipedia , lookup

Abuse of notation wikipedia , lookup

Ethnomathematics wikipedia , lookup

Foundations of mathematics wikipedia , lookup

Non-standard analysis wikipedia , lookup

Peano axioms wikipedia , lookup

Mathematics of Sudoku wikipedia , lookup

Non-standard calculus wikipedia , lookup

Surreal number wikipedia , lookup

Cartesian coordinate system wikipedia , lookup

List of first-order theories wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Addition wikipedia , lookup

Order theory wikipedia , lookup

Elementary mathematics wikipedia , lookup

Transcript
M101 - Mathematics I
Quiz 1 (Maximum Marks: 15 Marks)
1. Let A = N × N, where N is the set of natural number. Define a relation ∼ on
A by
(a, b) ∼ (c, d) ⇔ b − a = d − c.
(a) Show that ∼ is an equivalence relation on A.
(b) Find the elements of the equivalence class of (1, 2).
(c) Think A = N × N as the points in the first quadrant of the Cartesian
plane with both coordinates are natural numbers. Describe the equivalence classes pictorially.
[3+2+3]
2. Let E be the set of all even natural numbers and O be the set of all odd
natural numbers. Construct a bijection (one-one and onto function) from E
to O.
[4]
3. Recall that a set A is said to be countable if A is a finite set or there is a
bijection between N and A. Prove that every subset of N is countable.
(Hint: Every non-empty subset of N contains a least element.)
[8]
M101 - Mathematics I
Quiz 1 (Maximum Marks: 15 Marks)
1. Let A = N × N, where N is the set of natural number. Define a relation ∼ on
A by
(a, b) ∼ (c, d) ⇔ b − a = d − c.
(a) Show that ∼ is an equivalence relation on A.
(b) Find the elements of the equivalence class of (1, 2).
(c) Think A = N × N as the points in the first quadrant of the Cartesian
plane with both coordinates are natural numbers. Describe the equivalence classes pictorially.
[3+2+3]
2. Let E be the set of all even natural numbers and O be the set of all odd
natural numbers. Construct a bijection (one-one and onto function) from E
to O.
[4]
3. Recall that a set A is said to be countable if A is a finite set or there is a
bijection between N and A. Prove that every subset of N is countable.
(Hint: Every non-empty subset of N contains a least element.)
[8]