Relations#!#Ordered Pair#!#Cartesian Product of Sets

Ordered Pair|Exercise Questions|Cartesian Product Of Sets |Exercise Questions|Important Points|Relations|Relations As Subsets Of Cartesian Product Of Sets |Number Of Relations |Exercise Questions|Representations Of Relations|Domain Of Relations |Range Of

Ordered Pair|Cartesian Product With Properties|Relation|OMR

Ordered Pair|Exercise Questions|Cartesian Product Of Sets|Important Points|Exercise Questions|OMR

Let A = {1, 2, 3, 4, 5, …., 17, 18}. Let ' ~= ' be the equivalence relation on A xx A , cartesian product of A with itself, defined by (a,b) ~= (c, d) iff ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is

Introduction|Cartesian Products Of Sets|Examples|Properties Of Cartesian Product|Questions|Relations|Summary

What is Cartesian product of 2 sets ? (explain with example)

What is Cartesian product of 3 sets ?( explain with example)

Number of elements in cartesian product of sets Theorem ( If A and B are two finite sets then ;(n(A xx B))=n(A)xx n(B)

Consider the following statements in respect of relations and functions: 1. All relations are functions but all functions are not relations. 2. A relation from A to B is a subset of Cartesian product A x B. 3. A relation in A is a subset of Cartesian product A x A. Which of the above statements are correct?

Graphical representation of cartesian product