If $p$ is congruent to $3 \pmod 4$, and $n$ is the number of quadratic residues less than $p/2$, how can I show that $2\cdot 4\cdot 6\cdots (p-1)$ is congruent to $(-1)^{n+k}$ modulo $p$?
So $p=4k+3$ and I know $(-1/p)$ is congruent to $(-1)^{(p-1)/2}$ etc but can't think of a way to show the product of the even numbers is congruent to $(-1)^{n+k}$. Any hints/help would be much appreciated.
You can write the product as $2^{(p-1)/2}$ times $(\frac{p-1}2)!$ and treat both factors separately:
Quadratic reciprocity for $q=2$ + Gauss' criterion gives $2^{(p-1)/2}\equiv(-1)^{k+1}$.
Because $p\equiv3\pmod4$, the product of quadratic residues is $1$ (each quadratic residue comes with its inverse, and $-1$ isn't one of them). There are $(p-1)/2$ nonzero QR in total (odd number). By sending a QR $a$ to $p-a$ if it's $>p/2$, their product gets multiplied by $(-1)^{(p-1)/2-n}=(-1)^{n+1}$. The result equals $(\frac{p-1}2)!$, because there are $(p-1)/2$ QR's and $a$ and $p-a$ cannot simultaneaously be one.