Electronis Discussion
0 like 0 dislike
27 views

For an $n$-variable Boolean function, the maximum number of prime implicants is

  1. $2(n-1)$
  2. $n/2$
  3. $2^{n}$
  4. $2^{n-1}$
in Digital Circuits by (15.8k points)
recategorized by | 27 views

Please log in or register to answer this question.

Answer:
Welcome to GO Electronics, where you can ask questions and receive answers from other members of the community.
1,174 questions
78 answers
11 comments
43,898 users