[SOLVED] [Moved]How can a find the midterm and maxterm?

Status
Not open for further replies.

u24c02

Advanced Member level 1
Joined
May 8, 2012
Messages
404
Helped
2
Reputation
4
Reaction score
2
Trophy points
1,298
Visit site
Activity points
4,101
Hi.
Now I'm trying to sove this problem this.
ABC +AB'C'+AB'C+ABC'+A'B'C*

And
I have just found some discussion like this.
F(A,B,C) = m7+m4+m5+m6+m1
= A'B'C' + AB'C' + AB'C + ABC' + A'B'C
F'(A,B,C)= m0 + m2 + m3

If we complement F', we get F;
F = (m0 + m2 + m3)'
By DeMorgan's Theorem;

F = (A'B'C')'(A'BC')'(A'BC)'*
F = (A''+B''+C'')(A''+B'+C'')(A''+B'+C')
F = (A+B+C)(A+B'+C)(A+B'+C')


I want to know how can him did like this to solve?

p.s. How can found the midterm and maxterm?
 

Can I bind the not at boolean algebra?

Hi.

I wonder that is this right?

1. (A'B')' = A+B
2. (AB)'=A'+B'
3. A'B' = (AB)'
4. (A+B)'=A'B'
5.(A'B')=(A+B)'
6.A'B'C' = A'+B'+C'
I especially do not understand regard 6.
I think it should be (A+B+C)'.

Is this same between A'+B'+C' and (A+B+C)'?
 
Last edited:

Re: Can I bind the not at boolean algebra?

it should be (A+B+C)'
(A+B+C)' and A'+B'+C' are certainly different
 



Status
Not open for further replies.
Cookies are required to use this site. You must accept them to continue using the site. Learn more…