Re: [isabelle] Computing divisors

> How large are your numbers? If the memory from my crypto courses serves
> me well, trial division (you can go just up to the square root of n) is
> still the most efficient option for reasonably small numbers, e.g. 32-bit.

At least for square roots, there is an executable algorithm for 
floor (sqrt integer) and ceiling (sqrt integer)
(See Sqrt_Babylonian in the development version of the AFP)


This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.