Permutations of Non Distinct Objects

I have removed all annotations from my videos that were used to correct errors (YouTube is getting rid of Annotattions) Any errors in the videos have been corrected in the NOTES. If you have already subscribed, you can use your User Name and your Password to download the NOTES in a MS WORD FILE. or a PDF FILE. (If you have trouble downloading the file on your phone, use the Opera Browser) If you haven't subscribed, subscribe now

A typical problem of permutations of non-distinct objects is this: How many ways are there to arrange the letters of the word mississippi. The s's and the p's are non-distinct objects. There is no difference between one s and another. The previous formula that you know for permutations (watch my video "Counting methods") is applicable only to distinct objects. In this video, I do the problem about the word "mississippi".