Discrete math logical equivalences problem

[simple current]

Im getting stuck after simplifying it a bit

[proper latch]

1. Wait patiently for a helper to come along.
2. Once someone helps you, say thank you and close the thread with:

+close

3. Feel free to nominate the person for helper of the week in #helper-nominations
4. Do not ping the mods, unless someone is breaking the rules.
5. If you're happy with the help you got here, and the server overall, you can contribute financially as well:

[simple current]

i apply de morgans law for the first negation

but i dont know how to simplify the expression after that

[obtuse root]

Show what you've done so far

[simple current]

(P ^(P ^ ~Q)) V (P ^ Q)

[obtuse root]

$(P\land (P\land \not Q))\lor (P\land Q)$

[quasi mirage]

Apenguinarmy

[simple current]

yes

[obtuse root]

Now you can use the laws of annihilation

[simple current]

ah

[obtuse root]

$A\land (A\land B) = A \land B$

[quasi mirage]

Apenguinarmy

[simple current]

have not covered that in class yet

nvm

just didnt know it was called annhilation

[obtuse root]

Names differ, maybe I got it wrong too

[simple current]

im using this list as a reference

wait so our final answer will be
(P ^ ~Q) V (P ^ Q)

?

this seems like it can be simplified more

like maybe group the Q and ~Q together

but i cant find a law for it

[obtuse root]

Distributive next, it was probably associative and idempotent in the previous step

[simple current]

but distributive requires 3 variables

can we assume Q or ~Q to be something else?

[obtuse root]

That works

[simple current]

oh ok

thanks a lot!

[simple current]

+close