The number of ways in which all the integers from 1 to 36 (both inclusive) can be arranged such that no two multiples of 6 are adjacent is expressed as
$$ m! x^n Pr $$ where m, n, r are distinct positive integers.
What is the sum m + n + r?
How i can achieve this? Thanks in advance.
EDIT: The formula is $$ m!\times{^nP_r}$$ where $^nP_r = \frac{n!}{(n-r!)}$ is the number of $r$-permutations of $n$ or sequences without repetition of length $r$ chosen from an $n$-element set.