Hi,

Can someone help me with this question as I can't seem to get it:

How many ways can the letters of the word 'orange' be arranged so that no of the letters are in their original place? (i.e can't have ognear as o is in its original place but can have earong)

There are obviously $\displaystyle 6!$ number of ways for the letters to be arranged but how do you find out the number of ways without the letters being in the original place?

Thanks for all the help.