Abstract
This chapter discusses some combinatorial problems. If f is a permutation of a set Z, then f (1), f (2), … , f(n) are all elements of the set Z arranged in a certain order. Conversely, arranging elements of the set Z in any order one defines a permutation of this set, for one can associate with the number 1 the first element of the ordered set Z, with the number 2 the second one, …, with the number n the last element. The chapter also discusses permutations with repetitions. Two permutations of the set Z are called equivalent if they differ only by the arrangement of objects belonging to the same group. Two equivalent permutations constitute the same permutation with repetitions. The chapter presents a theorem which states that disjoint cycles are commutative.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
