All Questions

I already posted this question on MSE. Using theorem $IV$ from this article, it is possible to prove that when $p$ is a prime such that $p ≡ 3\bmod4$, $x ≢ y\bmod{p}$ and $\gcd(x,y) = 1$, then the ...

Given a prime $p\equiv 1\pmod 4$, Fermat's two-squares theorem discovered by Girard states that there exists two integers $A,B$ such that $p=A^2+B^2$. For all primes up to $10^7$ the integers $A$ and $...

Let $\pi=a+bi\in \mathbb{Z}[i]$ be a Gaussian prime with $a$ and $b$ nonzero, and $b$ even. For odd rational primes $p=\pi\bar\pi$ and $q\neq p$, define $\pi^{\frac{1}{2}\left(q-\left(\frac{-1}{q}\...

The quadratic reciprocity law states that for $p_1\ne p_2$ prime, the product $\left(\frac{p_1}{p_2}\right)\left(\frac{p_2}{p_1}\right)$ takes values $1$ or $-1$ depending on whether $p_1$ and $p_2$ ...

I'm trying to use FLINT (Fast Library for Number Theory) to calculate the Legendre Symbol of the following: $$\left(\frac{n! + 1}{p}\right)$$ In my case, $p$ is a positive, odd prime (specifically $...