A permutation with no fixed points is called what?
AA transposition
BA cyclic shift
CAn involution
DA derangement
Answer & Solution
Correct answer: D. A derangement
A permutation that moves every element, leaving none fixed, is a derangement.
Keep practising Permutations and Combinations
Browse all Permutations and Combinations questions for AP EAMCET, or explore more Mathematics topics.
Related questions
A permutation of a finite set is what kind of function on that set?A k-combination of a set S is best described as what?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?Two circular arrangements count as the same when?In C(n,k), what does the divisor k! account for?Which representation is used to prove the counting formula for multisets?