pc set theory

(i) Let X be a set of numbers and f : N n X be a function, then the ordered set {f(1), f(2),...., f(n)} is called a finite sequence in X. (ii) Let X be a set of numbers and f : N X be a function, then the ordered set {f(1), f(2),....} is called ..

In mathematics , a well-defined collection of definite objects is called a set. George Cantor is regarded as the "Father of Set theory". The concept of "Sets" is basic in all branches of mathematics . Important terms in Sets are:..

A well-defined collection of distinct objects is called a set..

Sets..

..

The theory of finite sets is, arguably, a definition of Combinatorics. In particular, certain combinatorial topics (e.g. Ramsey theory) have important direct analogues in "combinatorial" set theory. Since Axiomatic Set Theory..

Introduction - In Mathematics, a well-defined collection of definite objects is called a set. George Cantor is regarded as the "Father of Set theory". The concept of "Sets" is basic in all branches of mathematics. It has proved to be of particular importance ..

Union of sets - 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..

A set can be formed by using all the common elements of two given sets. Such a collection is called the intersection of the given sets..

There are two methods of representing a set. (i) Roster Method (ii) Set builder fo..