0 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 4.8k views answer comment Share Follow Add Sync Questions Print 0 reply Please log in or register to add a comment.
0 0 votes No option matches. The number of EPI is $2^{(n-1)}.$ Deepak Poonia answered Oct 7, 2023 Deepak Poonia comment Share Follow 0 reply Please log in or register to add a comment.