+2 votes
103 views

Given $x,y,z$ are Boolean variables and $f(x,y,z)=f(y',x',z)$. How many such functions are possible with $x, y, z$?

1. $0$
2. $2^2$
3. $2^4$
4. $2^6$
asked | 103 views
yes $2^6$
i want explanation i didn't get the explanation which was given in source.
unable to understand the que?? wht is que asking??

plz explain

## 1 Answer

+5 votes
Best answer

In a three variable boolean function if all of the truth table rows are independent w.r.t the O/P, then total no of boolean function possible is $2^{2^3} = 256$

• because in the O/P of a truth table we have $2^n= 2^3$ places to fill with 0 or 1.
• This is possible because we have not specified any constraint on the boolean function.

The question here provide us with a constraint equation $f(x,y,z) = f(y',x',z)$

because of this constraint, all 8 rows of the truth table are not independent now. They are in 6 groups.

1. $f(0,0,0) \ \ \ \text{ and } \ \ f(1,1,0)$ are having same O/P.
2. $f(0,0,1) \text{ and } f(1,1,0)$ are having same O/P.
3. $f(0,1,0) ,f(0,1,1) ,f(1,0,0) ,f(1,0,1) ,$ are independent.

So in these 6 rows of the truth table, we can fill up O/P with 0 or 1.

$\Rightarrow$ total $2^6$ functions possible.

note : we can also solve by calculating no of minterms and taking combinations of them.

answered by Veteran (43.9k points)
selected
highly appreciated !

question has same logic as Self dual function

+6 votes
1 answer
1
+1 vote
1 answer
2
+1 vote
2 answers
3