0 votes 0 votes For an $n$-variable Boolean function, the maximum number of prime implicants is $2(n-1)$ $n/2$ $2^{n}$ $2^{n-1}$ Digital Circuits gate2014-ec-2 boolean-algebra digital-circuits + – Milicevic3306 asked Mar 26, 2018 • recategorized Nov 15, 2020 by soujanyareddy13 Milicevic3306 16.0k points 618 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes No option matches. The number of EPI is $2^{(n-1)}.$ Deepak Poonia answered Oct 7, 2023 Deepak Poonia 1.3k points comment Share ask related question Follow See all 0 reply Please log in or register to add a comment.