Skip to main content

AMC 12 Mock Exam 1 Problem 21

Problem 21 of 25

A function σ:{1,2,…,10}→{1,2,…,10}\sigma:\{1,2,\dots,10\}\to\{1,2,\dots,10\} is chosen uniformly at random from among the 10!10! bijections of {1,2,…,10}\{1,2,\dots,10\} to itself. Let NN be the number of integers xx in {1,2,…,10}\{1,2,\dots,10\} for which σ(σ(σ(x)))=x\sigma(\sigma(\sigma(x)))=x. What is the expected value of NN?

Answer choices

Show solution

Solution

Decompose σ\sigma into disjoint cycles. We have σ3(x)=x\sigma^3(x)=x exactly when the length ℓ\ell of the cycle containing xx divides 33, i.e., ℓ=1\ell=1 or ℓ=3\ell=3.

Fix xx. The number of permutations in which xx lies in a cycle of length ℓ\ell is the same for every ℓ∈{1,…,10}\ell\in\{1,\dots,10\}: choose the ordered list of the other ℓ−1\ell-1 elements of its cycle in 9!(10−ℓ)!\frac{9!}{(10-\ell)!} ways, and permute the remaining 10−ℓ10-\ell elements arbitrarily in (10−ℓ)!(10-\ell)! ways, for a total of 9!9!. So xx lies in a cycle of any given length with probability 9!10!=110\frac{9!}{10!}=\frac1{10}.

Hence P(σ3(x)=x)=110+110=15P(\sigma^3(x)=x)=\frac1{10}+\frac1{10}=\frac15. By linearity of expectation, E[N]=10⋅15=2E[N]=10\cdot\frac15=\boxed{2}.

Tagged: random permutations, linearity of expectation, cycles