aboutsummaryrefslogtreecommitdiff
path: root/coqprime/gencertif/README
blob: a34915eea6655d535e87fbae430e4ddff2422151 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
pocklington [-v] [-o file] numspec 

options are:
	-v : verbose mode
        -o file : set the output in file "file"

numspec:
	* directly a prime number.
	* -next num : generate certificate for the next prime number following
             num.
        * -size s : generate certificate for a prime number with a least s
	     digits (in base 10).
        * -proth k n : generate certificate for the Proth number : k*2^n + 1.
        * -lucas n : generate certificate for the Mersenne number 2^n - 1
	     using Lucas test (more efficiant).
        * -mersenne n : generate certificate for the Mersenne number 2^n - 1
	     using Pocklington,
        * -dec file : generate certificate for the number given in file,
	     the file should also contain a partial factorization of the
	     predecessor.