To find the number of distinct ways to arrange the letters in the word MINING, we need to account for the repeated letters.
The formula for permutations with repetitions is:
$ \frac{n!}{n_1! n_2! ... n_k!} $Where:
In this case, $n = 6$. The frequencies of the repeated letters are 2 for 'I' and 2 for 'N'.
Number of arrangements = $ \frac{6!}{2! \times 2!} $
Therefore, there are 180 distinct ways to arrange the letters in the word MINING.
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.
