p=randomprime(2^2000) is significantly slower than isprime(p)

Georgi Guninski <[email protected]> Sun, 12 May 2024 12:38:21 +0300
Newsgroups gmane.comp.mathematics.pari.devel
Message-ID <CAGUWgD8XoGdsdR0ammRUG6EhVoeJVPM8Yvp6KSUie1F4U_cCvQ@mail.gmail.com>
I find it counter-intuitive p=randomprime(2^2000) to be
significantly slower than isprime(p)


Session
---
default(timer,1)
setrand(1)
p=randomprime(2^2000)
isprime(p)
ispseudoprime(p)
---