Are there any perfect numbers of the form $p^2q$, with $p$ and $q$ positive integer primes? Obviously the proper divisors of the number would be $1, p, q, pq, \text{ and } p^2$ and therefore we want to consider the diophantine equation $$p^2q=p^2+pq+p+q+1$$
Of course, there's an easy solution if you apply the Euclid-Euler theorem for even perfect numbers, but that's not totally general. How can you find all positive integer prime solutions to this diophantine equation?

The equation $p^2q=p^2+pq+p+q+1$ can be rewritten as
$$(p^2-p-1)q=p^2+p+1=(p^2-p-1)+2p+2$$
which implies $(p^2-p-1)$ divides $2p+2$, which in turn implies $p^2-p-1\le2p+2$, or $p^2-3p-3\le0$, which implies $p\le3$. Of the two possibilities, $p=2$ gives a solution: $(4-2-1)q=4+2+1$ implies $q=7$, which is prime. But $p=3$ does not: $(9-3-1)q=9+3+1$ implies $q=13/5$, which is not an integer, much less prime.