## Find the number of boolean functions of n variable that satisfy the following condition

For how many boolean functions is this true? The length of the shortest disjunctive normal form of that functions is equal to 2^(n-1). And the the number of variable entries in the minimal dnf of that functions is equal to n*(2^(n-1)-1). Answer AttributionSource : Link , Question Author : Ani Kar , Answer Author : … Read more