Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Homework Help
Engineering and Comp Sci Homework Help
Boolean Algebra, Minimum Sum of Products Problem
Reply to thread
Message
[QUOTE="vela, post: 6000111, member: 221963"] The AC'D' term corresponds to 8 and 12, which means it's true when ABCD=1000 or ABCD=1100. Similarly, the BC'D term corresponds to 5 and 13, so it's true when ABCD=0101 or ABCD=1101. The ABC' term corresponds to 12 and 13, so it's true when ABCD=1100, which means AC'D' is also true, or when ABCD=1101, which means BC'D is also true. So the ABC' term turns out to be redundant. I think the notation in the solution means that the 12 from AC'D' and 13 from BC'D combine to form ABC', so that term can be deleted. The next line in the solution is the combining of the A'B'CD' and AB'C terms.There's a typo as a prime on D inside the parentheses is missing. It should say A'B'CD' + AB'C = B'C (A'D' + A) = B'C (D' + A) = AB'C + B'CD'. [/QUOTE]
Insert quotes…
Post reply
Forums
Homework Help
Engineering and Comp Sci Homework Help
Boolean Algebra, Minimum Sum of Products Problem
Back
Top