Number of permutations of the letters of the word BANGLORE such that the string ANGLE appears together in all permutations, is
Step-by-step Solution:
The word is ``BANGLORE'' whose letters are \(B,A,N,G,L,O,R,E\) (all distinct). We require that the string ``ANGLE'' (the letters \(A,N,G,L,E\) in that order) appears together as a block. Treat ``ANGLE'' as one single item. Then the items to arrange are: \[ \{\text{ANGLE (block)},\,B,\,O,\,R\}, \] i.e. \(4\) distinct items. These can be arranged in \(4!\) ways. The block ``ANGLE'' has a fixed internal order, so there are no additional arrangements inside it. Hence the number of permutations is \[ 4! = 24. \] \[ \boxed{24} \]