Helping someone out with this one.... A'B'C'D'+A'B'CD+A'BC'D+A'BCD'+AB'C'D+ABC'D' = F Tried many times and not having much success with it. Any suggestions? Hope questions like this belongs in this forum! EDIT: ' means NOT and + means OR.

You're going to have to clarify your operators, I'm assuming ' means NOT and + means AND? ¬ and ^ the more traditional representations. If my understanding of your symbols is correct then maybe you should post the whole question because what you have there can be simplified to "X ^ ¬X = F" which is really just a description of the axioms you are working with.

That makes sense I guess since there is obviously an implied AND between the operands. Next you will have to define what you mean by simplified. I see plenty of common factors that could be pulled outside of some brackets.

Cheers all. After sleeping on it came up with (A' OR C') AND (A XOR B) XOR (C XOR D) Was tired last night and didn't word the question correctly... My bad, sorry. Was meant to simplify the equation to use the least amount of gates possible.

I don't do boolean logic often enough to do it in my head easily, I find it helps to right out a result table. There's only four inputs, so you've got 16 maximum combinations. A B C D F 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 etc. once you work out the result in each case, any patterns become obvious and you can then write a new equation to match the output.

Thge outputs were listed above. You end up with a k-map that looks like this: 1 0 1 0 0 1 0 1 1 0 0 0 0 1 0 0 Worked out it can't be solved algebraically (well, you MIGHT be able to).