Asked by Samuel
How many ways can you arrange the letters in the word Toronto if you must begin with a T and end in an O?
Answers
mathhelper
Fill in the restrictions first: we have 2 Ts, and 3 Os, let's assume they are all
different, e.g. a red T and a blue T
TxxxxxO
2xxxxx3
2*5*4*3*2*1*3
but the Os are indistinguishable as are the Ts, so we divide by 3! and 2!
so 2*5*4*3*2*1*3/(3!2!)
= 60
different, e.g. a red T and a blue T
TxxxxxO
2xxxxx3
2*5*4*3*2*1*3
but the Os are indistinguishable as are the Ts, so we divide by 3! and 2!
so 2*5*4*3*2*1*3/(3!2!)
= 60
Anonymous
630