{"id":6771,"date":"2021-10-21T15:28:34","date_gmt":"2021-10-21T09:58:34","guid":{"rendered":"https:\/\/mathemerize.com\/?p=6771"},"modified":"2021-10-25T01:33:37","modified_gmt":"2021-10-24T20:03:37","slug":"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","status":"publish","type":"post","link":"https:\/\/mathemerize.com\/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\/","title":{"rendered":"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?"},"content":{"rendered":"
5 different mangoes can be distributed by following ways among 3 children such that each gets at least 1 :<\/p>\n
Total number of ways : (\\(5!\\over 3!1!1!2!\\) + \\(5!\\over 2!2!2!\\)) \\(\\times\\) 3!<\/p>\n
Now, the number of ways of distributing remaining fruits (i.e. 4 oranges + 3 apples) among 3 children = \\(3^7\\) (as each fruit has 3 options).<\/p>\n
Therefore, Total number of ways = (\\(5!\\over 3!2!\\) + \\(5!\\over {(2!)}^3\\)) \\(\\times\\) 3! \\(\\times\\) \\(3^7\\)<\/p>\n
How many different words can be formed by jumbling the letters in the word \u2018MISSISSIPPI\u2019 in which no two S are adjacent ?<\/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 The number of ways in which 6 men and 5 women can dine at a round table, if no two women are to sit together, is given by<\/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