Scribd
Upload
19 views1 page

Practical 8

The document outlines practical exercises related to permutations of objects, including finding compositions of permutations and understanding properties of functions defined as permutations. It also includes tasks such as determining the number of even permutations and expressing permutations as products of disjoint cycles. Additionally, it presents a card arrangement problem and requires calculations involving specific permutations.

Uploaded by

lenafatema46
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views1 page

Practical 8

The document outlines practical exercises related to permutations of objects, including finding compositions of permutations and understanding properties of functions defined as permutations. It also includes tasks such as determining the number of even permutations and expressing permutations as products of disjoint cycles. Additionally, it presents a card arrangement problem and requires calculations involving specific permutations.

Uploaded by

lenafatema46
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Practical – 8 (Permutation of objects)

Objective

12345 12345
1. Let 𝛼 = ,𝛽 = . Find 𝛽𝛼.
24513 35142
𝟏𝟐𝟑𝟒𝟓 𝟏𝟐𝟑𝟒𝟓
(a) . (b)
𝟐𝟒𝟓𝟏𝟑 𝟑𝟓𝟏𝟒𝟐
𝟏𝟐𝟑𝟒𝟓 𝟏𝟐𝟑𝟒𝟓
(c) (d)
𝟓𝟑𝟐𝟏𝟒 𝟓𝟒𝟐𝟑𝟏

2. Let ℕ = {1,2, … 𝑛} for a positive integer n, then 𝑓: ℕ → ℕ is a permutation if


(a) 𝒇 is one-one but not onto. (b) 𝒇 is one-one and onto.
(c) 𝒇 is onto but not one-one. (d) 𝒇 is any function.

3. What is the number of even permutations in 𝑆 ?


(a) 𝟑 (b) 𝟒
(c) 𝟎 (d) 𝟔

4. The number of elements in 𝑆 is ______.

1 2 3 4 5 6 7
5. If 𝛼 = ∈ 𝑆 , then 𝛼 is ____.
3 1 2 4 5 6 7
1 2 3 4 5 6
6. If 𝜇 = ∈ 𝑆 , then the number of disjoint cycles in the expression of
4 1 5 6 3 2
𝜇 as their product is ______.

Descriptive

1. Cards numbered 1 to 9 are laid out in the following manner.


1 2 3
4 5 6
7 8 9
They are picked up row-wise and redealt column-wise in the same array size as
follows:
1 4 7
2 5 8
3 6 9
How many times must this procedure be carried out before the cards reappear in their
original position?

1 2 3 4 5 6 7 8
2. Express as a product of disjoint cycles.
3 5 4 7 8 1 6 2

3. Let 𝛼 = (1 2 3 7)(4 9)(5 8)(6), 𝛽 = (1 3 5)(2 4 6)(7 8 9). Find


𝛼𝛽, 𝛽𝛼, 𝛼 , 𝛽 , 𝛼 , 𝛽 .

1 2 3 4 1 2 3 4
4. Let 𝑓 = ,𝑔 = . Find 𝑓 ∘ 𝑔, 𝑔 ∘ 𝑓.
2 3 4 1 4 3 1 2

You might also like