Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
272 views
in Mathematics by (94.6k points)
closed by
In a n election, the number of candidates exceeds the number to be elected y 2. A man can vote in 56 ways. Find the number of candidates.

1 Answer

0 votes
by (97.5k points)
selected by
 
Best answer
Correct Answer - 6
Let the number of candidates be n. Therefore, (n-2) are to be elected and so one can vote up to n-2. Hence, the number of ways in which one can vote is
`.^(n)C_(1)+ .^(n)C_(2)+..+ .^(n)C_(n-2)=56` (given)
or `2^(n)-(.^(n)C_(n-1)+ .^(n)C_(n))=56`
or `2^(n)-n=58`
or `2^(n)=58+n`
which is satisfied by n =6 only.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...