mini-gmp mpm_sqrtrem

[Niels Möller]

bodrato at mail.dm.unipi.it writes:

> Let x = ceil(n/2), then n >= 2x-1, the minimum number that can be
> represented with n limbs is B^(n-1) >= B^(2x-2). Its root is >= B^(x-1),
> that require at least x limbs to be represented.
>
> Correct?

I think so. Looks like that should hold even if for some reason
GMP_NUMB_BITS is odd.

> I'll add the assert.

Thanks.

Regards,
/Niels

-- 
Niels Möller. PGP-encrypted email is preferred. Keyid C0B98E26.
Internet email is subject to wholesale government surveillance.