|
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
- Delivery-date: Sun, 12 May 2024 11:38:53 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20230601; t=1715506731; x=1716111531; darn=pari.math.u-bordeaux.fr; h=to:subject:message-id:date:from:mime-version:from:to:cc:subject :date:message-id:reply-to; bh=C2o+TLrhKPz6bdUEWSpHzMhGF9x5VejUTjq6m4lMvlU=; b=nLAatJmRGhZvvSmqGmIdNErbFS4fwrZTrsVlEOmplIXhOYKvJXNWtU+9LNklBERH54 CqF4wbKlXnnKkhwoHtddvGIxgIxrEv2wEM63Lv4Xcg90W29tMXRHszdSiuFSY0NOqmHm 2KvyiU/eU4uRO0MwCiyxRum5dzrKtqKEglAj/RrMgry+OjvfMBnAZY8UBdfx9FepJ4X5 Re7mYbEeChmQ3kk1Ykx1FOVgqTdBlINaOXBBEH/CrzPFWQRJF8Nz8LxXPUgBFQ/B61Sp C9SfZFrmeqr7dN3HZ+b5x0aAI3PwYejo/WGg2ny3odnTlnv63bp8D0+yjDcIZJGRehjy 0J1g==
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)
---