The question is: a plug board has 26 letters, and there are 13 cables. The cables connect all possible pair of letters.
How many possible configurations does the plug board provide? In other words, how many ways can 26 letters be divided into 13 pairs?
The result I found by calculation and some logic is:
$$25\cdot 23\cdot 21\cdot 19\cdot 17\cdot 15\cdot 13\cdot 11\cdot 9\cdot 7\cdot 5\cdot 3 = 7 905 853 580 625.$$
Is this correct?
How is the mathematical algorithm and formula to calculate this and similar problems?
One way to count would be as follows.
Consider the letters ordered, and labeled as $1,2,3,4,\dots,2N$. Let $A(N)$ be the number of possibilities to "pair them in $N$ pairs". We take the first letter, $1$, and pair it, i.e. we count its possible pairings. There are $(2N-1)$ possibilities. We make a choice of the $1$-match, eliminate this pair from the list, reorder, and count again.
In this way we get inductively: $$ A(2N)=(2N-1)A(2N-2)\ . $$ Because $A(2)=1$, we get the formula $A(2N)=(2N-1)(2N-3)\cdots5\cdot 3\cdot 1$.
(Some people call this number $(2N-1)!!$.)
(It is hard to put the hands on the "similar problems" part of the question.)