pub fn rational_reconstruct( x: &BigUint, m: &BigUint, ) -> Option<(BigInt, BigInt)>
Recover the unique reduced p/q with |p|, |q| <= sqrt(M/2) and p ≡ q·x (mod M), or None if none exists within the bound.
p/q
|p|, |q| <= sqrt(M/2)
p ≡ q·x (mod M)
None