simlify using boolean algebra : x(y'+z)+z'
By the distributive law we have xy' + xz + z' also, just looking at the right two terms, we see that xz + z' => x + z' This gives xy' + x + z', but it doesn't really matter whether y is true or not since xy' is conditional on x so that reduces to just x + z'
@Valpey xz + z' => x + z' (i did not understand this part, which law are you using here) xy' + x + z' ( this i guess is the absorption law like x+xy = x )
yeah, since if x is true it doesn't matter what z is
T10 on this page http://www.ee.surrey.ac.uk/Projects/CAL/digital-logic/boolalgebra/index.html
could you please tell me the name of the law used fot this step xz + z' => x + z' (like idempotent, distributive, associative, de morgan, absorption etc ) which one did you use here
Join our real-time social learning platform and learn together with your friends!