edited by
477 views

1 Answer

Best answer
7 votes
7 votes

We can fill the $3\times3$ gray area in $2^9 = 512$ ways and then adjust the rows and columns with the yellow regions such that each row and columns eventually contains odd no of $1$'s. 

Then observed the following:


Region A and B, the sum of bits in each of the regions must be odd. Therefore both yellow regions must be either odd or even at the same time. So, there is no conflict in the left bottom corner position. Finally, the answer is $512$.

edited by
Answer:

Related questions

5 votes
5 votes
2 answers
1
Bikram asked May 24, 2017
567 views
Let $S$ be the set $\{1,2,3, \dots ,8\}$. Let $n$ be the number of sets of two non-empty disjoint subsets of $S$. The value of $n$ is _______.
3 votes
3 votes
1 answer
2
Bikram asked May 24, 2017
275 views
$O(G) = 12$ and $G$ is cyclic. The total number of generators possible in $G$ are __________.
8 votes
8 votes
3 answers
3
Bikram asked May 24, 2017
413 views
See the above table of a,b,c,d. The total number of subgroups possible from the above diagram are _______.
2 votes
2 votes
1 answer
4
Bikram asked May 24, 2017
345 views
$A$ and $B$ are two sets such that $n(A) * n(B) = 7$ and $A \subset K \subset B$, where $n(X)$ is the cardinality of set $X$ and $K$ is a set. Then, to satisfy proper su...