Apparently the solution is because ‘abracadabra’ has 11 letters. But this is not correct because replacing first ‘a’ with the last ‘a’ for example would not give a different solution, and by simply using permutations we count some words more than once.

The word ‘abracadabra’ contains following letters: ‘a’ – 5 times, ‘b’ – 2 times, ‘r’ – 2 times, ‘c’ – 1 time, ‘d’ – 1 time.

To see the number of scrambles we can consider 11 empty positions which we fill with letters like this:

1. First choose the positions where to place ‘a’ . There are: = distinct choices.

2. Then choose the positions where to place ‘b’. Here we have = choices because 5 from the total of 11 free position are already filled with ‘a’.

3. Choose the positions where to place ‘r’: =

4. Choose the position for ‘c’: =

5. The remaining position is for ‘d’: = . This is of course 1 but later you’ll see why I keep writing it as a formula.

Then the total is:

= =

The blue formula above, shows actually a different way of looking at the problem. If we would count all the permutations () then each permutation of ‘a’ letters will cause repeats. So we need to divide the total number of permutations to , because we have 5 ‘a’ letters. From the same reason we need to divide with for ‘b’ letters, with for ‘r’ letters, and with for ‘c’ and ‘d’.

good