In how many permutations of 1,..,n does the integer 1 precede the integer 2? (For instance, (1,3,2), as opposed to (2,3,1)).
I am trying to check my answer to this competition practice problem: (n-1)!
In how many permutations of 1,..,n does the integer 1 precede the integer 2? (For instance, (1,3,2), as opposed to (2,3,1)).
I am trying to check my answer to this competition practice problem: (n-1)!
You can think of this way: the number $n_1$ of cases that 1 precedes 2 is equal of the number $n_2$ of cases that 2 precedes 1, cause there's nothing especial between these two numbers. But, these two situations are complementary, so:
$$ \left\{ \begin{array}{c} n_1 + n_2 = T \\ n_1 = n_2 \\ \end{array} \right. $$
With $T$ being the total number of cases, $T=n!$
Finally: $n_1=n_2=\frac{n!}{2}$