Thank you for submitting an example text correction or rephasing. We will review the example in a short time and work on the publish it.

Leave us a comment of this math problem and its solution (i.e. if it is still somewhat unclear...):

Showing 1 comment:

Math Student

Since there are no repeating letters, and there are 5 total letters, there are 5!=120 ways to arrange them. In other words, there are 5 slots to place the first letter in, then 4 slots for the second letter, 3 for the third, 2 for the fourth, and then the last letter goes in the 1 slot that is left. 5*4*3*2*1=5!=120