*To*: Ognjen Maric <ognjen.maric at gmail.com>*Subject*: Re: [isabelle] Computing divisors*From*: René Thiemann <rene.thiemann at uibk.ac.at>*Date*: Sat, 19 Oct 2013 08:37:18 +0200*Cc*: isabelle-users at cl.cam.ac.uk, Manuel Eberl <eberlm at in.tum.de>*In-reply-to*: <5261FA8F.2010705@gmail.com>*References*: <5261A6A0.3040604@in.tum.de> <5261FA8F.2010705@gmail.com>

> 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) Cheers, René

**References**:**[isabelle] Computing divisors***From:*Manuel Eberl

**Re: [isabelle] Computing divisors***From:*Ognjen Maric

- Previous by Date: Re: [isabelle] Computing divisors
- Next by Date: Re: [isabelle] Computing divisors
- Previous by Thread: Re: [isabelle] Computing divisors
- Next by Thread: Re: [isabelle] Computing divisors
- Cl-isabelle-users October 2013 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list