(1) Let Nn = {1, 2, · · · , n} for a positive integer n then, f : Nn → Nn is a permutation if

(a) f is one one but not

(1) Let Nn = {1, 2, · · · , n} for a positive integer n then, f : Nn → Nn is a permutation if

(a) f is one one but not onto.

(b) f is one one and onto.

(c) f is onto but not one one.

(d) f is any function.

(2) What is the number of even permutations in S3?

(a) 3 (b) 4 (c) 0 (d) 6​

About the author
Abigail

1 thought on “(1) Let Nn = {1, 2, · · · , n} for a positive integer n then, f : Nn → Nn is a permutation if<br /><br />(a) f is one one but not”

Leave a Comment