|
Max Alekseyev on Thu, 20 Oct 2011 21:56:59 +0200
|
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
|
issquare() for t_INTMOD's
|
- To: pari-users@pari.math.u-bordeaux.fr
- Subject: issquare() for t_INTMOD's
- From: Max Alekseyev <maxale@gmail.com>
- Date: Thu, 20 Oct 2011 23:56:53 +0400
- Delivery-date: Thu, 20 Oct 2011 21:56:59 +0200
- Dkim-signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=gamma; h=mime-version:date:message-id:subject:from:to:content-type; bh=6nSj0j/J1MdKYF3IdGJ5/UiNsQRKnMMk0qY12keAjy4=; b=uGXmEBqf2ypIM07aK3Z0Q5hhzFrqIaAXTALXHJ65Slo+igTbcTVPZXffyL4RmE+V/M y4lL+AS3qk+/8NSCCpI5wnh6VRQaKecxUfQUksTcxMu0CEBwrT8sRehLm+ypGwCeleVK DAO2qw1C5q0tDebCQZJZrxeCHG0fTTU4M5woQ=
Why issquare() is so much slower than kronecker()?
? p = nextprime(10^10)
%1 = 10000000019
? for(i=1,10^6, issquare( Mod(random(p),p) ) )
? ##
*** last result computed in 19,690 ms.
? for(i=1,10^6, kronecker(random(p),p) )
? ##
*** last result computed in 521 ms.
Regards,
Max