introduction to set theory

If two sets are given, a set can be formed by using all the elements of the two sets. Such a collection is called the union of the given sets..

The Operations on Sets are: Union of sets, Intersection of sets, Disjoint sets, Difference of two sets (Relative complement), Symmetric Difference of two sets, Complement of a set..

Two finite sets A and B are said to be equivalent sets if cardinality of both sets are equal i.e. n (A) = n (B..

The number of elements in a finite set A, is the cardinality of A and is denoted by n(A..

The family of all subsets of any set S is called the power set of S. We denote the power set of S by P (S). If a set S is finite, say S has n elements, then the power set of S can be shown to have 2 n elemen..

Summary - A well-defined collection of definite objects is called a set. In roster method of representing a set, all the elements are listed in the set. In property method of representing a set, all the elements are represented by stating all the properties which are s..

Introduction - You are familiar with factors and products in the case of numbers. For example, 8 is the product of 4 and 2. 4 and 2 are called the products of 8 . Similarly, the algebraic expression a x b x c = abc can be written as 1.a.b.c or 1.ab.c or 1.bc.a or 1.ac.b or 1.abc. 1, a, b,..

A set is finite if it contains a specific number of elements. Otherwise, a set is an infinite set..