Discrete Mathematics Level 5

Let us call an arrangement of the letters of the word VIBGYOR good if it doesn't contain any string of letters (length \(\geq\) 2 letters) present in the original word (VIBGYOR). How many good arrangements are there?

Details and Assumptions

  • For example, OYVIBRG is not acceptable as it contains the string VIB.

  • But, IVGBROY is acceptable.


Problem Loading...

Note Loading...

Set Loading...