Chapter 15: Problem 3
a) How many rows are needed to construct the (function) table for a Boolean function of \(n\) variables? b) How many different Boolean functions of \(n\) variables are there?
/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none}
Learning Materials
Features
Discover
Chapter 15: Problem 3
a) How many rows are needed to construct the (function) table for a Boolean function of \(n\) variables? b) How many different Boolean functions of \(n\) variables are there?
All the tools & learning materials you need for study success - in one app.
Get started for free
Obtain a minimal-product-of-sums representation for \(f(w, x, y, z)=\prod M(0,1,2,4,5,10,\), \(12,13,14)\).
a) If \(9 B_{1}, 9 A_{2}\) are Boolean algebras and \(f: 9 B_{1} \rightarrow S_{2}\) is one-to-one, onto, and such that \(f(x+y)=f(x)+f(y)\) and \(f(\bar{x})=\overline{f(x)}\), for all \(x, y \in \mathscr{B}_{1}\), prove that \(f\) is an isomorphism. b) State and prove another result comparable to that in part (a). (What principle is used here?)
In each of the following, \(f: B^{4} \rightarrow B\), where the Boolean variables (in order) are \(w, x, y\), and \(z\). Determine \(\left|f^{-1}(0)\right|\) and \(\left|f^{-1}(1)\right|\) if, as a minimal sum of products, \(f\) reduces to a) \(\bar{x}\) b) \(w y\) c) \(w \bar{y} z\) d) \(x+y\) e) \(x y+z\) f) \(x y \bar{z}+w\)
Let \(F_{6}\) denote the set of all Boolean functions \(f: B^{6} \rightarrow B\). a) What is \(\left|F_{6}\right|\) ? b) How many fundamental conjunctions (disjunctions) are there in \(F_{6}\) ? c) How many minterms (maxterms) are there in \(F_{6}\) ? d) How many functions \(f \in F_{6}\) have the value 1 when (exactly) two of its variables have the value 1 ? (In all other circumstances, the value of \(f\) may be 0 or 1 .) e) How many functions \(f \in F_{6}\) have the value 1 when at least two of its variables have the value 1? (In all other circumstances, the value of \(f\) may be 0 or 1.) f) Let \(u, v, w, x, y\), and \(z\) denote the six Boolean variables for the functions in \(F_{b-}\) How many of these functions are independent of \(x\) [that is, \(f(u, v, w, x, y, z)=\) \(f(u, v, w, \bar{x}, y, z)]\) ? How many are independent of all three of the Boolean variables \(x, y, z ?\)
Let \(a, b, c \in \mathscr{B}\), a Boolean algebra. Prove that \(a b+c=a(b+c)\) if and only if \(c \leq a\).
What do you think about this solution?
We value your feedback to improve our textbook solutions.