Home
Class 12
MATHS
In a n election, the number of candidate...

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.

Text Solution

Verified by Experts

The correct Answer is:
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.
Promotional Banner

Similar Questions

Explore conceptually related problems

In an election, the number of candidates exceeds the number to be elected by 2. A man can vote in 56 ways. Find the number of candidates.

In an election, the number of candidates is one greater than the persons to be elected. If a voter can vote in 254 ways, the number of candidates is a. 7 b. 10 c. 8 d. 6

In an election there are 7 candidates and 4 members are to be elected and a voter is entitled to vote any number to be elected . In how many ways may a voter choose his vote ?

In an election the number of contestants is one more than the number of maximum candidates for which a voter can vote. If the total number of ways in which a voter can vote be 62, find the number of candidates.

At an election there are 5 candidates and 3 members are to be elected and a voter is entitled to vote for any number to be elected . In how many ways a voter choose his vote ?

At an election a voter may vote for any number of candidates not greater than the number of candidates to be chosen there are 10 candidates and 5 members are to chosen the number of ways in which a voter may vote at a least one candidate is given by

Find the number of ways in which the number 94864 can be resolved as a product of two factors.

If the numbers n – 2, 4n – 1 and 5n + 2 are in A.P., find the value of n.

Six cards and six envelopes are numbered 1 ,2 , 3, 4 , 5,6 and cards are to be placed in envelopes so that each envelope contains exaxtly one card and no card is placed in the envelope bearing the same number and moreover the card numbered 1 is always placed in envelope number 2 . Then the number of ways it cann be done is -

If the number of elements of set A are n, then show that the number of sub sets of A are 2^n .