{"id":6942,"date":"2021-10-22T01:52:51","date_gmt":"2021-10-21T20:22:51","guid":{"rendered":"https:\/\/mathemerize.com\/?p=6942"},"modified":"2021-10-25T01:24:38","modified_gmt":"2021-10-24T19:54:38","slug":"at-an-election-a-voter-may-vote-for-any-number-of-candidates-not-greater-than-the-number-of-candidates-to-be-elected-there-are-10-candidates-and-4-are-to-be-elected-if-a-voter-votes-for-atleast-1-c","status":"publish","type":"post","link":"https:\/\/mathemerize.com\/at-an-election-a-voter-may-vote-for-any-number-of-candidates-not-greater-than-the-number-of-candidates-to-be-elected-there-are-10-candidates-and-4-are-to-be-elected-if-a-voter-votes-for-atleast-1-c\/","title":{"rendered":"At an election, a voter may vote for any number of candidates not greater than the number of candidates to be elected. There are 10 candidates and 4 are to be elected. If a voter votes for atleast 1 candidate, then the number of ways in which he can vote is"},"content":{"rendered":"
Total Number of ways = \\(^{10}C_1\\) + \\(^{10}C_2\\) + \\(^{10}C_3\\) + \\(^{10}C_4\\)<\/p>\n
= 10 + 45 + 120 + 210<\/p>\n
= 385<\/p>\n
A student is to answer 10 out of 13 questions in an examination such that he must choose atleast 4 from the first five questions. The number of choices available to him is<\/a><\/p>\n The number of ways of distributing 8 identical balls in 3 distinct boxes, so that none of the boxes is empty, is<\/a><\/p>\n How many ways are there to arrange the letters in the word \u2018GARDEN\u2019 with the vowels in alphabetical order ?<\/a><\/p>\n If the letters of the word \u2018SACHIN\u2019 are arranged in all possible ways and these words are written out as in dictionary, then the word \u2018SACHIN\u2019 appears at serial number<\/a><\/p>\n