in Digital Circuits recategorized by
59 views
0 votes
0 votes

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 recategorized by
15.8k points
59 views

Please log in or register to answer this question.

Welcome to GO Electronics, where you can ask questions and receive answers from other members of the community.