{"id":6934,"date":"2021-10-22T01:44:25","date_gmt":"2021-10-21T20:14:25","guid":{"rendered":"https:\/\/mathemerize.com\/?p=6934"},"modified":"2021-10-25T01:30:07","modified_gmt":"2021-10-24T20:00:07","slug":"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","status":"publish","type":"post","link":"https:\/\/mathemerize.com\/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\/","title":{"rendered":"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"},"content":{"rendered":"
If out of n points,\u00a0 m are collinear, then<\/p>\n
Number of triangles = \\(^nC_3\\) – \\(^mC_3\\)<\/p>\n
\\(\\therefore\\)\u00a0 Number of triangles = \\(^{10}C_3\\) – \\(^6C_3\\)<\/p>\n
= 120 – 20<\/p>\n
= 100<\/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 If all the letters of the word \u2018RAPID\u2019 are arranged in all possible manner as they are in a dictionary, then find the rank of the word \u2018RAPID\u2019.<\/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