{"id":6852,"date":"2021-10-21T21:02:58","date_gmt":"2021-10-21T15:32:58","guid":{"rendered":"https:\/\/mathemerize.com\/?p=6852"},"modified":"2021-10-25T01:31:13","modified_gmt":"2021-10-24T20:01:13","slug":"from-a-group-of-10-persons-consisting-of-5-lawyers-3-doctors-and-2-engineers-four-persons-are-selected-at-random-the-probability-that-selection-contains-one-of-each-category-is","status":"publish","type":"post","link":"https:\/\/mathemerize.com\/from-a-group-of-10-persons-consisting-of-5-lawyers-3-doctors-and-2-engineers-four-persons-are-selected-at-random-the-probability-that-selection-contains-one-of-each-category-is\/","title":{"rendered":"From a group of 10 persons consisting of 5 lawyers, 3 doctors and 2 engineers, four persons are selected at random. The probability that selection contains one of each category is"},"content":{"rendered":"
n(S) = \\(^{10}C_4\\) = 210<\/p>\n
n(E)= \\(^5C_2 \\times ^3C_1 \\times ^2C_1\\) + \\(^5C_1 \\times ^3C_2 \\times ^2C_1\\) + \\(^5C_1 \\times ^3C_1 \\times ^2C_2\\) = 105<\/p>\n
\\(\\therefore\\) P(E) = \\(105\\over 210\\) = \\(1\\over 2\\)<\/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 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