Home › TS EAMCET › Mathematics › Permutations and Combinations › A permutation of a finite set is what kind of fu…
A permutation of a finite set is what kind of function on that set?
AConstant function
BBijective function
CMany-one function
DInto function only
Answer & Solution
Correct answer: B. Bijective function
A permutation maps a finite set onto itself one-to-one and onto, so it is a bijection.
Related questions
Al-Khalil's cryptography book listed words using which idea?A k-combination of a set S is best described as what?Cauchy's 1815 memoir on substitutions of n elements led to which notion?Which Chinese text used permutation-like hexagrams as early as 1000 BC?How many elements does the symmetric group on 4 objects contain?In how many ways can the letters of BANANA be arranged?A multiset permutation uses each element how many times?A permutation that swaps exactly two elements and fixes all others is called what?