Skip to content
Quantoros

Permute positions 1,...,10 so every item moves by at most one place. How many such permutations move exactly six items?

Quant ResearchLevel: AdvancedAdjacent swaps and counting

Permute positions 1,...,10 so every item moves by at most one place. How many such permutations move exactly six items?

Hints
  • Prove moves must form disjoint adjacent transpositions.
  • Count separated choices by compressing mandatory gaps.

Answer

This answer is part of mentoring

Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.

Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial

Related questions