edited by
2,375 views
9 votes
9 votes
A switching function is said to be neutral if the number of input combinations for which its value is $1$ is equal to the number of input combinations for which its value is $0.$ Compute the number of neutral switching functions of $n$ variables (for a given $n$).
edited by

1 Answer

31 votes
31 votes
For an 'n' variable function, total number of possible minterms(input combinations) will be $2^n$. Half of them will be one i.e, $2^{n-1}$.

Thus total number of neutral functions possble = Choosing any $2^{n-1}$ combinations to be 1 out of $2^n$ combination. i.e  $2^{n} \choose 2^{n-1}$.
edited by

Related questions

26 votes
26 votes
3 answers
1
makhdoom ghaya asked Nov 30, 2016
3,462 views
Find values of Boolean variables $A, B, C$ which satisfy the following equations:A+ B = 1AC = BCA + C = 1AB = 0
11 votes
11 votes
2 answers
2
makhdoom ghaya asked Nov 30, 2016
2,913 views
Explain the behaviour of the following logic circuit with level input $A$ and output $B$.
10 votes
10 votes
3 answers
3
makhdoom ghaya asked Nov 29, 2016
1,586 views
Show that {NOR} is a functionally complete set of Boolean operations.