Returns one of the two possible solutions of _x² = a mod p_, if any. The other solution is _-x mod p_. If there is no solution, returns `None`. Reference: H. Cohen, _A course in computational algebraic number theory_, Algorithm 1.4.3 ## Implementation details To avoid multiplication overflows, internally the algorithm uses the `128`-bit arithmetic. Also see [`cipolla`].
(a: i64, odd_prime: u64)
source not stored for this graph (policy: none)
no test coverage detected