Find all mutually non-equivalent $A(p,q)$ so that $(Aq\rightarrow \overline{p}) = (p+A)$ is true regardless of $p$ and $q$, where $\overline{x}$ is negation, $xy$ is conjunction, $x+y$ disjunction, $x\rightarrow y$ implication and $x=y$ equivalence.
\begin{matrix}p&q&A&(Aq\rightarrow \overline{p}) = (p+A)\\ 0&0&0&0\\ 0&0&1&1\\ 0&1&0&0\\ 0&1&1&1\\ 1&0&0&1\\ 1&0&1&1\\ 1&1&0&1\\ 1&1&1&0 \end{matrix}
From the truth table we see that: $((Aq\rightarrow \overline{p}) = (p+A)) = \overline{p}\overline{q}A + \overline{p}qA + p\overline{q}\overline{A} + p\overline{q}A + pq\overline{A}$
$$\overline{p}\overline{q}A + \overline{p}qA + p\overline{q} + pq\overline{A} = 1$$
\begin{align} A&=\overline{p}\overline{q}+\overline{p}q+\overline{(pq)}=\\ &=\overline{p}+\overline{p}+\overline{q}=\\ &=\overline{p}+\overline{q} \end{align}
Cheking result $$((\overline{p}+\overline{q})q\rightarrow \overline{p})=p+(\overline{p}+\overline{q})$$
For $p=0$ and $q=0$ $$ ((1+1)0\rightarrow 1)=0+(1+1)\\ (0\rightarrow 1) = 1 \\ 1=1 \\ $$
For $p=0$, $q=1$ $$ ((1+0)1\rightarrow 1)=0+(1+0)\\ (1\rightarrow 1)=1 \\ 1=1 \\ $$
For $p=1$, $q=0$ $$ ((0+1)0\rightarrow 0)=1+(0+1)\\ (0\rightarrow 0)=1 \\ 1=1 \\ $$
For $p=1$, $q=1$ $$ ((0+0)1\rightarrow 0)=1+(0+0)\\ (0\rightarrow 0)=1 \\ 1=1 \\ $$
This is a correct solution, but is it the only one?
I ask because the question uses the word all, and though that may not mean anything, I'd just like to check in case I missed something.
Line 5 of the table shows that while $Aq\rightarrow \overline{p} = p+A$ is satisfied, you do not have that $A = \overline{p}+\overline{q}$, and so it is not even a solution to the equation.
Moreover, lines 5 and 6 demonstrate that you cannot express $A$ as a function of $p$ and $q$ to get all solutions, since in both lines $Aq\rightarrow \overline{p} = p+A$ is satisfied, and while the values of $p$ and $q$ are the same, the value of $A$ is not the same.