It is known that if $x^2 + y^2 = z^2$ is a primitive Pythagorean triplet then $z$ is not divisible by any prime of the form $4k-1$. The following is a generalization of this classical result which shows that the source of this property is not the hypotenuse $z$, but the two orthogonal side $x$ and $y$:
Conjecture: Let $f(x,y) = a_0x^n + a_1 x^{n-1}y + a_2x^{n-2}y^2 + \cdots + a_ny^n$, $a_0a_n \ne 0$. Then there are infinitely many primes of the form $8k+3$ which do not divide $f(x,y)$ for any primitive Pythagorean triplet $x^2 + y^2 = z^2$.
Example: Taking $f(x,y) = x^n + y^n$, the conjecture says that for every there are infinitely many primes which do not divide the sum of the two orthogonal sides of any Pythagorean triangle. The conjecture has been proved for $x+y$ (in MSE) and is already known to be true for $x^2 + y^2$. Experimental data shows that $x^3 + y^3$ is not divisible by infinitely many primes of the form $8k+3$ while $x^4 + y^4$ is not divisible by infinitely many primes of the form $8k+3, 8k+5$ and $8k+7$.
Question: Is the conjecture known? I am looking for a proof or disproof of the conjecture.
The conjecture was proved for special case $f(x) = x+y$ in MSE but the general case remains open. Hence it is posted in MO.