In how many ways can you divide the set of eight numbers {2,3,4,5,6,7,8,9} into 4 pairs such that no pair of numbers has G.C.D equal to 2?
Need help in dividing a set into different pairs
263 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail AtThere are 2 best solutions below
On
$2$ must be paired with an odd number.
$6$ can not be paired with an even number that doesn't also have three as a divisor so $6$ must be paired with an odd number.
$4$ may (but doesn't have to be) paired with $8$ and there are no other restrictions.
There are $4$ odd numbers to pair with TWO.
And after that there are $3$ remaining odd numbers to pair with SIX.
And for the remaining four numbers there are ${4\choose 2}$ ways to choose a the third pair and ${2 \choose 2} =1$ way to choose the last pair.
But choosing $(a,b)$ then $(c,d)$ is the same as $(c,d) $ then $(a,b)$ so this is double counting. There are $\frac 62 = 3$ ways to choose the final two pairs.
(Alternatively given any of the $4$ remaining unpaired numbers there are $3$ numbers we can pair with it. And the remaining to numbers must pair together.)
So there are $4*3*3 = 36$ such ways.
Given this set of numbers, the only way for a pair of them to have a greatest common denominator of $2$ would be for both of them to be even... with one exception. We are allowed to pair $(4, 8)$, because in this case they will have a GCD of $4$, not $2$.
So let's split this problem into (a) the cases where $(4, 8)$ are not a pair, and (b) the cases where $(4, 8)$ are a pair.
In case (a), we have to pair each even number with an odd number. So our pairs are $(2, \_)$, $(4, \_)$, $(6, \_)$, and $(8, \_)$. We have to place the four remaining odd numbers $\{3, 5, 7, 9\}$ into these blanks. So there are $4! = 24$ total possibilities here.
In case (b), we know that $(4, 8)$ are a pair. However we still aren't allowed to make the pair $(2, 6)$, as these would have a GCD of $2$. But other than this, anything is game. The remaining numbers are $\{2, 3, 5, 6, 7, 9\}$. Let's think of the pairs this time as $(2, \_)$, $(6, \_)$, and $(\_, \_)$ There are $4$ options for the first blank, $3$ options for the second blank, and after this the last two are determined. This makes $4\cdot 3 = 12$ possibilities here.
So all in all, I count $24+12=36$ total possible ways.
EDIT: you can also verify that this reasoning is correct by exhaustively listing all 36 possible pairings. Here are the ones I came up with: