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

Georgi Guninski on Sun, 12 May 2024 11:38:53 +0200

[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

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

To: pari-dev@pari.math.u-bordeaux.fr
Subject: p=randomprime(2^2000) is significantly slower than isprime(p)
From: Georgi Guninski <gguninski@gmail.com>
Date: Sun, 12 May 2024 12:38:21 +0300

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)
---

Follow-Ups:
- Re: p=randomprime(2^2000) is significantly slower than isprime(p)
  - From: Georgi Guninski <gguninski@gmail.com>

Prev by Date: Re: select()ing a Map
Next by Date: Re: p=randomprime(2^2000) is significantly slower than isprime(p)
Previous by thread: Re: Using builtin PARI operators in gp
Next by thread: Re: p=randomprime(2^2000) is significantly slower than isprime(p)
Index(es):
- Date
- Thread