There are 2n guests at a dinner party.supposing that the master and mistress of the house have fixed seats opposite one another, and that there are two specified guests who must not be placed next to one another, let the number of ways in which the company can be placed be $(m({n^2}) - k(n) + 4)(2n - 2)!$ find k-m?

Hint: In this question the concept of permutations and combinations will be used. We need to apply logic and general algebra to proceed through the problem. We will first all the cases in which the two guests cannot be placed next to one another, and then add them. In order to select r unique things from a total number of n things , the number of ways are-
${}^n{C_r} = \dfrac{{\left| \!{\underline {\,
  n \,}} \right. }}{{\left| \!{\underline {\,
  {(n - r)} \,}} \right. \left| \!{\underline {\,
  r \,}} \right. }}$

Complete step-by-step answer:
Let M and M’ represent seats of the master and mistress respectively , and let
${a_1},{a_2},{a_3},.....,{a_{2n}}$represent the $2n$seats. Let the guests who must not be placed next to one another be called X and Y.
Now, we will put X in a position adjacent to $M({a_1})$. Now, Y can be placed everywhere except ${a_2}$, and the place occupied by X. let us place Y at the place ${a_3}$.
The rest of the (2n-2) places can be arranged in $\left| \!{\underline {\,
  {\left( {2n - 2} \right)} \,}} \right. $ ways . similarly, Y can be placed in $2n - 2$such places. Hence, the total number of ways in which guests are placed when X is at ${a_1}$ are
$\left( {2n - 2} \right)\left| \!{\underline {\,
  {\left( {2n - 2} \right)} \,}} \right. $
Similarly, X can be placed in four such places adjacent to M and N, so the total number of ways for this are
 $4\left( {2n - 2} \right)\left| \!{\underline {\,
  {2n - 2} \,}} \right. $………(1)
When X is placed in any of the remaining $2n - 4$places, Y cannot be placed in the two places adjacent to X. so, the number of places in which Y can be placed are $(2n - 3)$.
The remaining of the (2n-2) guests can be placed in $\left| \!{\underline {\,
  {\left( {2n - 2} \right)} \,}} \right. $ways.
So the total number of ways in which all the guests can be arranged are
$(2n - 4)(2n - 3)\left| \!{\underline {\,
  {(2n - 2)} \,}} \right. $…….(2)
We will add these two separate cases to get the total number of ways in which the guests can be arranged. This is given by equation (1) and (2)
$\
  4(2n - 2)\left| \!{\underline {\,
  {(2n - 2)} \,}} \right. + (2n - 4)(2n - 3)\left| \!{\underline {\,
  {2n - 2)} \,}} \right. \\
   = \left| \!{\underline {\,
  {(2n - 2) \times (8n - 8 + 4{n^2} - 14n + 12)} \,}} \right. \\
   = \left| \!{\underline {\,
  {(2n - 2) \times (4{n^2} - 6n + 4)} \,}} \right. \\
\ $
Hence, $k = 6$ and $m = 4$ then,
\[\]$\
  k - m = 6 - 4 \\
   = 2 \\
\ $
This is the number of ways in which the company can be placed.

Note: There is no direct method to solve this problem. We need to form the equation according to the question and simplify it using general algebra. One common mistake is that students often forget the formula for combinations and permutations, which should be remembered. Also, we should keep in mind the arrangement of the guests is circular and not linear.