* FromFactorBigInt returns n such that d | Mn if n <= max and d is odd. In other cases zero is returned. It is conjectured that every odd d ∊ N divides infinitely many Mersenne numbers. The returned n should be the exponent of smallest such Mn. NOTE: The computation of n from a given d performs ro
(d *big.Int, max uint32)
source not stored for this graph (policy: none)