Find divisors using congruences

23 Views Asked by At

We have $n := 115921$ , $2^{\frac{n-1}{4}} \equiv 963 \pmod{n}$, and $2^{\frac{n-1}{2}} \equiv 1 \pmod{n}$. How would you calculate a divisor of $n$ and why will the method work correctly (without using any computational tool)?