I have to convert the following to NAND/NOR only
(A $\wedge$ B) $\vee$ (A $\wedge$ C) $\vee$ (B $\wedge$ C)
I understand how to do this problem if it was only
(A $\wedge$ B) $\vee$ (A $\wedge$ C)
but I can't seem to make a logical negation for the third AND.
EDIT: I seem to have forgot to include that I want to get the result by only using two input NAND gates.
Just "invert" every single logical symbol, hence you will get:
\begin{align*} &\neg ( (A \land B) \lor (A\land C) \lor (B \land C))\\ \iff &(\neg(A \land B) \land \neg(A\land C) \land \neg(B \land C))\\ \iff &(\neg A \lor \neg B) \land (\neg A \lor \neg C) \land (\neg B \lor \neg C) \end{align*}
Meaning, when is your first expression wrong? Iff all of your brackets are wrong iff 2 of A,B,C are wrong.