In how many ways is it possible to choose a w | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(D) chess board has $32$ black and $32$ white squares.Total ways to choose one white and one black square $= {}^{32}C_{1} 	imes {}^{32}C_{1} = 32 	i

Vedclass · Accepted Answer

$768$

Vedclass · Answer

(D) chess board has $32$ black and $32$ white squares.Total ways to choose one white and one black square $= {}^{32}C_{1} 	imes {}^{32}C_{1} = 32 	imes 32 = 1024$.There are $8$ rows,and each row contains $4$ white squares and $4$ black squares.Ways to choose a white and a black square in the same row $= 8 	imes ({}^{4}C_{1} 	imes {}^{4}C_{1}) = 8 	imes 16 = 128$.Similarly,there are $8$ columns,and each column contains $4$ white squares and $4$ black squares.Ways to choose a white and a black square in the same column $= 8 	imes ({}^{4}C_{1} 	imes {}^{4}C_{1}) = 8 	imes 16 = 128$.Total ways where squares lie in the same row or column $= 128 + 128 = 256$.Therefore,the required number of ways $= 1024 - 256 = 768$.

In how many ways is it possible to choose a white square and a black square on a chess board so that the squares do not lie in the same row or column?

Similar Questions

$A$ polygon has $35$ diagonals; then the number of its sides is:

Eight chairs are numbered $1$ to $8$. Two women and three men wish to occupy one chair each. First,the women choose the chairs from amongst the chairs marked $1$ to $4$,and then men select the chairs from amongst the remaining. The number of possible arrangements is

$A$ test consists of $6$ multiple choice questions,each having $4$ alternative answers of which only one is correct. The number of ways in which a candidate answers all six questions such that exactly four of the answers are correct is:

All possible four-digit numbers are formed using the digits $0, 1, 2, 3$ such that no digit is repeated. The number of even numbers among them is

There are $6$ members to be selected for a group to be sent abroad from a total of $12$ members. In how many ways can the selection be made such that a particular member is always excluded?

Vedclass Test Series

Exam Paper Generator

Online Exam Module