Daniel B. answered 11/15/20
A retired computer professional to teach math, physics
In a hand with two pair you will see three different denominations --
two of them will provide a pair each, one of them will provide a single card.
First we figure out all the possible ways of choosing the denominations,
and then for each choice of denominations we count the number of way
of choosing the suits.
Since this platform does not allow me to enter the normal notation for
"n chose k", I will write it as (n,k).
A = (13,2) is the number of ways of choosing the two denominations of pairs.
For each such choice there are
B = 11 ways of choosing the denomination of a single.
For each such choice there are
C = 4 choices of a suit for the denomination of singles.
For each such choice there are
D = (4,2) ways of choosing a pair of suits for one pair.
For each such choice there are
E = (4,2) ways of choosing a pair of suits for the other pair.
Evaluating:
A = (13,2) = 13 x 12 / 2 = 78
D = E = (4,2) = 4 x 3 / 2 = 6
So the total number of such poker hands is
A x B x C x D x E = 78 x 11 x 4 x 6 x 6 = 123,552