I had no idea where to post this but can anyone help me with a little Boolean algebra. Wolfram alpha doesn't seem to like this very much.
the problem is huge but this is only a small small part of it. Can anyone solve:
( ( A' or B or C )' or ( A or D )' or D')'
thank you.
This is the whole problem.
[url]http://filesmelt.com/dl/Boolean_algebra.PNG[/url]
the blue is what i have posted
I have no clue what you are asking, but last time I had to solve something like this I wrote a programm in c to do it for me. (well actually that was the assignment)
[QUOTE=VistaPOWA;38030484][img]http://localhostr.com/files/BrRpkKi/boolhomework1.png[/img][/QUOTE]
I'm pretty sure he wants it simplified or something, not "brute-forced".
That's called a truth table, not bruteforcing.
[QUOTE=VistaPOWA;38031444]That's called a truth table, not bruteforcing.[/QUOTE]
Yeah, but can't you call it bruteforcing? It's about the same principle.
For the bit you wanted solved, D.(A' + B + C)
Wolfram alpha appears to agree: (can't link because vbulletin is retarded, query is "not ( not ( not A or B or C) or not (A or D) or not D)")
I'm not sure why the truth table disagrees, perhaps I misread the problem
We have a math thread in GD
Read up on De Morgan's law.
Sorry, you need to Log In to post a reply to this thread.