Rearranging all of the letters of the word MATHEMATICS, how many distinct strings can we form?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There are 1 1 ! different ways to arrange the letters. However, to account for distinctiveness, we have to account for letters that occur greater than one ( M , A , T all occur twice in the word).
⟹ 2 ! 2 ! 2 ! 1 1 ! = 8 3 9 9 1 6 8 0 0 = 4 9 8 9 6 0 0