Possible solutions of a diophantine equation: $p^2+pq+275p+10q=2008$ What are couples of prime integers that verify this diophantine equation: $$p^2+pq+275p+10q=2008?$$
I tried to solve this equation trough the rules of modular-arithmetic. I rewrite the equation as: $$p^2+pq\equiv 2008 \pmod5.$$ The equation can be rewrite also as: $p^2+pq\equiv 3 \pmod5$.
Now I analyzed five possible cases: $p^2\equiv 0$, $p^2\equiv 1$, $p^2\equiv 2$, $p^2\equiv 3$ and $p^2\equiv 4$.


*

*We can not that if $p^2\equiv 0$ also $pq\equiv 0$ therefore the equation is impossible

*$p^2\equiv 2$ is impossible because $2$ is a  non-quadratic residue $\pmod5$

*also $p^2\equiv 3$ is impossible because $3$ is a non-quadratic residue $\pmod5$.

*If $p^2\equiv 1 \pmod5$, $p\equiv \pm 1$, therefore $p\equiv -1\equiv 4 \pmod5$ and  $p2\equiv 1 \pmod5$. These values are not acceptable because if $p=9$ ($9\equiv 4 \pmod5$) $275\cdot 9>2008$, if $p=11$ ($11\equiv 1\pmod5$) $275\cdot 9>2008$ therefore two values aren't acceptable.

*If $p^2\equiv 4 \pmod5$, $p\equiv \pm2$ and if $p\equiv -2\equiv 3 \pmod5$ there not exist solutions for the same reason of previous example. If $p\equiv 2 \pmod5$ possible values of $p$ are $2$ or $7$ because $275p<2008$. Replacing $p=2$ we obtain a valor not integer of $q$ while replacing $p=7$ we obtain $q=2$ therefore this is the only solution of equation. 


Is correct my process or are there other solutions?
Thanks:)

This isn't the most clever approach, but it is a universal approach to quadratic diophantine equations to start by removing linear terms (completing the square).
$$
\begin{align}
p^2+pq+275p+10q
&=2008 
\end{align}
$$
Shift to remove linear terms: $p=u+a,q=v+b$
$$
\begin{align}
(u+a)^2+(u+a)(v+b)+275(u+a)+10(v+b)
&=2008\\
u^2+uv+(2a+b+275)u+(a+10)v
&=2008-a^2-ab-275a-10b
\end{align}
$$
Now we can set $a=-10$ and $b=-255$ to eliminate the linear terms:
$$
\begin{align}
u^2+uv
&=2008-100-2550+2750+2550\\
u(u+v)&=4658=2\cdot17\cdot137
\end{align}
$$
There are only $16$ possible integers solutions for $(u,v)$, which then are shifted to corresponding values for $(p,q)$. You can inspect which pairs $(p,q)$ are positive primes. Actually since you know you are looking for positive $p$, and $p=u-10$, then $u$ is at least $12$, so there are only six solutions for $u$: $17,34,137,274,2329$, and $4658$. This is just a shortcut to save yourself some checking.
