conjunction of disjunctions and disjunction of conjunctions

Solution 1:

$\begin{array}{ll} 1. & (p\lor q)\land(p\lor r)\land(q\lor r)=\\ 2. & (p\lor(q\land r))\land(q\lor r)=\\ 3. & ((p\lor(q\land r))\land q)\lor ((p\lor(q\land r))\land r)=\\ 4. & ((p\land q)\lor((q\land r)\land q))\lor ((p\land r)\lor((q\land r)\land r))=\\ 5. & ((p\land q)\lor(q\land r))\lor ((p\land r)\lor(q\land r))=\\ 6. & (p\land q)\lor(q\land r)\lor (p\land r)\lor(q\land r)=\\ 7. & (p\land q)\lor(q\land r)\lor (p\land r) \end{array}$

2. factorize $p$
3. distribute $(q\lor r)$
4. distribute $q$ and $r$
5. simplify $(a\land b)\land a=a\land b$
6. eliminate superfluous parenthesis in a chain of $\lor$
7. simplify $a\lor a=a$

Solution 2:

$\Leftarrow:$ Suppose $(p\wedge q)\vee(p\wedge r)\vee(q\wedge r)$. Then at least one of the statements $(p\wedge q), (p\wedge r)$ or $(q\wedge r)$. Suppose $(p\wedge q)$ is true. Then $p,q$ are true. So $p\vee q,\ p\vee r,\ q\vee r$ are true. Hence $(p\vee q)\wedge (p\vee r)\wedge( q\vee r)$ is true. Similarly handle the cases $ p\vee r$, $\ q\vee r$.

$\Rightarrow:$ Suppose $(p\vee q)\wedge (p\vee r)\wedge( q\vee r)$ is true. Then $(p\vee q), (p\vee r), ( q\vee r)$ are true. Suppose $p$ is false. Then $q$ is true since $p\vee q$ is true, and $r$ is true since $p\vee r$ is true. In a similar way show that when $q$ is false $p$ and $r$ are true, and when $r$ is false $p$ and $q$ are true. So $(p\vee q)\wedge (p\vee r)\wedge( q\vee r)$ is true. Also, observe that if $p,q,r$ all are true then $(p\vee q)\wedge (p\vee r)\wedge( q\vee r)$ is true.

Hence you have the required logical equivalence.

Note that this answer is not complete. I encourage you to fill the gaps.