{"id":6936,"date":"2021-10-22T01:46:53","date_gmt":"2021-10-21T20:16:53","guid":{"rendered":"https:\/\/mathemerize.com\/?p=6936"},"modified":"2021-10-25T01:29:14","modified_gmt":"2021-10-24T19:59:14","slug":"how-many-different-words-can-be-formed-by-jumbling-the-letters-in-the-word-mississippi-in-which-no-two-s-are-adjacent","status":"publish","type":"post","link":"https:\/\/mathemerize.com\/how-many-different-words-can-be-formed-by-jumbling-the-letters-in-the-word-mississippi-in-which-no-two-s-are-adjacent\/","title":{"rendered":"How many different words can be formed by jumbling the letters in the word ‘MISSISSIPPI’ in which no two S are adjacent ?"},"content":{"rendered":"
Given word is MISSISSIPPI,<\/p>\n
Here, I occurs 4 times, S = 4 times<\/p>\n
P = 2 times, M = 1 time<\/p>\n
So, we write it like this _M_I_I_I_I_P_P_<\/p>\n
Now, we see that spaces are the places for letter S, because no two S can be together<\/p>\n
So, we can place 4 S in these 8 space in \\(^8C_4\\) ways.<\/p>\n
and we can arrange other 7 letters in \\(7!\\over 4!2!\\) ways.<\/p>\n
Hence, total number of words can be formed = \\(^8C_4\\) \\(\\times\\) \\(7!\\over 4!2!\\)<\/p>\n
= 7. \\(^8C_4\\) . \\(^6C_4\\)<\/p>\n
In how many ways can 5 different mangoes, 4 different oranges & 3 different apples be distributed among 3 children such that each gets atleast one mango?<\/a><\/p>\n From 6 different novels and 3 different dictionaries, 4 novels and 1 dictionary are to be selected and arranged in a row on the shelf so that the dictionary is always in the middle. Then, the number of such arrangements is<\/a><\/p>\n There are 10 points in a plane, out of these 6 are collinear. If N is the number of triangles formed by joining these points, then<\/a><\/p>\n Let \\(T_n\\) be the number of all possible triangles formed by joining vertices of an n-sided regular polygon. If \\(T_{n+1}\\) \u2013 \\(T_n\\) = 10, then the value of n is<\/a><\/p>\n