Is there a solution other than solution
\begin{equation*} (3^{2}-1)(3^{2}-1)=2^{6}=4^{3} \end{equation*}
of the Diophantine equation \begin{equation*} (3^{n}-1)(3^{m}-1)=x^{r} \end{equation*} for positive integers $ n, m, x, r $ such as $ n, m, x \geq 2 $ and $ r \geq 3 $ ?
these ought to be relatively rare, by Zsigmondy. However, in that theorem, we are not told the exponent on the new prime. So, for example, $3^5 - 1 = 2 \cdot 11^2.$ The new prime, $11,$ is squared, and we find $$ (3^2 - 1)(3^5 - 1) = 44^2 $$
Usually, a new prime is has exponent $1.$
Made a list, my program was able to completely factor and show the new prime(s) until $n$ became a prime over 35... I could do those in gp-pari