Exclusive Or -Logic Find a formula using only the connectives: conjunction, disjunction, and negation that is equivalent to,   P exclusive or Q. I cannot figure out a way to come up with a logical equivalent statement without randomly guessing.

Given a truth table of a boolean function, you can always create a boolean function that is equivalent using only conjunction, disjunction, and negation.
If one looks at the truth value of xor, it is only true in two cases: if $p$ is true and $q$ is false OR $p$ is false and $q$ is true which can be written as $(p \wedge \overline{q}) \vee (\overline{p} \wedge q)$.
