edited by
1,291 views
3 votes
3 votes

How many different Boolean functions of degree $n$ are the

  1. $2^{2^n}$
  2. $(2^2)^n$
  3. $2^{2^n} -1$
  4. $2^n$ 
edited by

1 Answer

3 votes
3 votes
$A$ $B$ $f_0$ $f_1$ $f_2$ $f_3$ $f_4$ $f_5$ $f_6$ $f_7$ $f_8$ $f_9$ $f_{10}$ $f_{11}$ $f_{12}$ $f_{13}$ $f_{14}$ $f_{15}$
0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1
0 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1
1 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1
1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

As we can see from the above table ,

Using $n$ boolean variables (here $n=2$ $A,B$ are boolean variables),

We can create $2^n$ combinations ($00,01,10,11$)

and using those $2^n$ combinations we can create $2^{2^n}$ functions ($16$ functions = $f_0,f_1,....f_{15}$)

$\therefore$ Option $1.$ is correct.

edited by
Answer:

Related questions

1 votes
1 votes
2 answers
2
Arjun asked Jul 2, 2019
5,171 views
Find the zero-one matrix of the transitive closure of the relation given by the matrix $A$ :$$A =\begin{bmatrix} 1 & 0& 1\\ 0 & 1 & 0\\ 1& 1& 0 \end{bmatrix}$$$\begin{bma...
0 votes
0 votes
1 answer
4