[GAP Forum] IsPrime

[Enis Karaarslan]

Well, I had dealed with prime numbers in my master thesis.
I had used my own algorithm-coded in GAP and compared it with Gap's
implementation
Well it is not a complicated work, but it can give some idea.

The system consists of these tests:
Perform division with small prime numbers (first 1028 primes)
Miller&Rabin Test. 
Lucas Test

I also used division with Carmichael numbers test.

A paper of this survey can be found in this link:
http://bornova.ege.edu.tr/%7Eenis/bildiri/PrimeTestingAndSecurity_01042002.d
oc 


Enis Karaarslan
Ege University

-----Original Message-----
From: forum-bounces at gap-system.org [mailto:forum-bounces at gap-system.org] On
Behalf Of Vdovin Evgenii
Sent: Thursday, June 09, 2005 8:29 AM
To: forum at gap-system.org
Subject: [GAP Forum] IsPrime

Dear pubbers!

I wonder if anybody knows what algorithm is used in GAP to check whether
a given integer is prime.  Does anybody know another program that can
check whether a given integer is prime? Now I'm considering a prime
p=2^44497-1 and the problem is to check if p^2-p+1 is prime.

-- 
Best Regards
Vdovin Evgenii
Institute of Mathematics
pr-t Acad. Koptiug, 4
630090, Novosibirsk, Russia
Office phone +7 3832 331390
Home phone +7 3832 644892
Fax +7 3832 332598

_______________________________________________
Forum mailing list
Forum at mail.gap-system.org
http://mail.gap-system.org/mailman/listinfo/forum