The problem asks for the number of ways to seat three husband-wife pairs around a circular table such that each husband sits next to his wife. Since arrangements are based on relative positions, we use circular permutation principles.
The core constraint is that each husband must sit next to his wife. This means we can consider each husband-wife pair as a single, indivisible unit.
The number of ways to arrange $n$ distinct items in a circle is given by the formula $(n-1)!$.
Within each pair unit (e.g., Husband A and Wife A), the two individuals can switch positions.
To find the total number of possible seating arrangements satisfying the condition, we multiply the number of ways to arrange the units around the table by the number of ways to arrange individuals within each unit.
Therefore, there are 16 possible seating arrangements.
How many words can be formed with the letters of the word 'POSTMAN', if every word begins with T and ends with M?
In how many ways can cells in a $3 \times 3$ grid be shaded, such that each row and each column have exactly one shaded cell? An example of one valid shading is shown.
