i have an exam test question in arithmetic: If $p=4k+3$ is prime then exist $x$, $y\in\mathbb{Z}$ such that $p| (x^2+y^2+1)$. Is that anyway to prove this?
2026-04-02 15:15:09.1775142909
If $p=4k+3$ is prime then exist $x$, $y\in\mathbb{Z}$ such that $p| (x^2+y^2+1)$
77 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
Hint:
This is the same as showing that there exists $x,y\in\mathbb Z$ such that $$x^2+y^2\equiv_p -1\iff x^2\equiv_p -1-y^2$$
Try to count the number of elements in $\mathbb Z_p$ that can be written as $x^2$, and the number of elements that can be written as $-1-y^2$. Let
How is $|A|$ and $|B|$ related? Also, which one on the options below is true?