View Single Post
Old 2016-03-05, 21:22   #3
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

22·3·17·19 Posts
Default

You need this sort of thing in your input file:

Code:
ABC 43*71^$a+300
1
2
3
4
5
6
...
Alternatively you can specify it with:

Code:
ABC2 43*71^$a+300
a: from 1 to 1000000
Using the "-f" -- for factor -- flag will greatly improve your speed.

You might find that someone has written a sieve for this form.

A word of warning: To prove a number prime you need at least 12.5% of the factorisation of N^2-1, where N is the number being proven. See this page. Otherwise, general purpose proving algorithms, such as ECPP, work up to about 30k digits if you are very patient, whereas numbers that can be proven by BLS N+/-1 can be proved in minutes to hours.

Look in pfgwdoc.txt and abcfileformats.txt for more info.

Last fiddled with by paulunderwood on 2016-03-05 at 21:24
paulunderwood is offline   Reply With Quote