Did you get a syntax error? Or did you get "Too many arguments"? Also: A recommendation: If you want to find small base 2 primes, just use Proth.exe. It saves the primes onto a log.

[QUOTE=3.14159;223252]Did you get a syntax error? Or did you get "Too many arguments"?[/QUOTE]
got a error opening file error why can't it make it's own file.

[QUOTE=science_man_88]got a error opening file error why can't it make it's own file.
[/QUOTE]

I'm not at all knowledgeable on the workings of PARI. I tried writing a sample file earlier this morning, but got the same error. In that case, just use Proth.exe:

You can download it [URL="http://primes.utm.edu/programs/gallot/"]here[/URL].

Recommendation: Do [B]not[/B] use Proth.exe for large primes. It is disastrously slow. Use it if you wish to find small primes. A few hundred digits, Proth.exe can handle. For anything larger than about 1.5-2k digits, use PFGW + NewPGen. If you want to get started faster, use command-line PFGW. You can merely drag the file onto PFGW's icon and it will automatically begin testing. (Unless you set a pmax, that might extend it to 2.5-4k digits)

Also: Don't use PrimeForm for large primes either. It is obsolete.

A 40k-digit prime would have been big news.. 50 years ago. :missingteeth: No wait.. actually about a bit over half that time ago.. (M132049, 39751 digits, 1983)

Also: p * 2[sup]q[/sup] + 1 prime: 251 * 2[sup]7561[/sup] + 1 (2279 digits)

[CODE]2^2+1 Fermat
2^4+1 Fermat
6^2+1 Generalized Fermat
10^2+1 Generalized Fermat
14^2+1 Generalized Fermat
2^8+1 Fermat
20^2+1 Generalized Fermat
24^2+1 Generalized Fermat
26^2+1 Generalized Fermat
36^2+1 Generalized Fermat
40^2+1 Generalized Fermat
54^2+1 Generalized Fermat
56^2+1 Generalized Fermat
66^2+1 Generalized Fermat
74^2+1 Generalized Fermat
84^2+1 Generalized Fermat
90^2+1 Generalized Fermat
94^2+1 Generalized Fermat
[B]2^4+1 Fermat[/B]
[B]2^8+1 Fermat[/B]
6^4+1 Generalized Fermat
2^16+1 Fermat
20^4+1 Generalized Fermat
24^4+1 Generalized Fermat
28^4+1 Generalized Fermat
34^4+1 Generalized Fermat
46^4+1 Generalized Fermat
48^4+1 Generalized Fermat
54^4+1 Generalized Fermat
56^4+1 Generalized Fermat
74^4+1 Generalized Fermat
80^4+1 Generalized Fermat
82^4+1 Generalized Fermat
88^4+1 Generalized Fermat
90^4+1 Generalized Fermat
[B]2^8+1 Fermat[/B]
[B]2^16+1 Fermat
2^16+1 Fermat[/B]
44^16+1 Generalized Fermat
74^16+1 Generalized Fermat
76^16+1 Generalized Fermat
94^16+1 Generalized Fermat
30^32+1 Generalized Fermat
54^32+1 Generalized Fermat
96^32+1 Generalized Fermat
46^512+1 Generalized Fermat[/CODE]

why all the repeats(bold)

Because there are different representations of the (Fermat) powers of two.

16[sup]2[/sup] = 2[sup]8[/sup]
4[sup]4[/sup] = 2[sup]8[/sup]
4[sup]8[/sup] = 2[sup]16[/sup]

I'm crap at this

[QUOTE=science_man_88]I'm crap at this
[/QUOTE]

Some reading on the subject might help out. See [URL="http://www.prothsearch.net/"]here[/URL].

Also: It'd be nice to do some factor work again. I downloaded the latest YAFU, which included Fermat's factoring algorithm in order to deal with small numbers.

I don't get what this tells me that the forum titles don't

Isn't it odd that there are many forms of prime that have their own world records? (Cofactors, Proth, Primorial, Factorial, Mersenne, Lucas, Fibonacci, Generalized Fermat, Generalized Fermat divisors, Unique, Repunit, Generalized Unique, etc.)
And some of the factoring algorithms have their *own* records? (ECM, GNFS, QS, etc.)

But trial division does not? Why not set a record for trial division? If there were actually any efforts directed at that, a factor record for trial division would have been set: a square of a p15 or p16. (Ex: 24562666344439701409543274011801)

Also: Prime post (421). Woots.

Some large Trial Division records: [url]http://primes.utm.edu/top20/page.php?id=18[/url]

trial(n) = a=0;forprime(x=2,sqrt(n),if(n%x==0,a=a+1;break()));if(a<1,print(n" is prime"))

my trial factor code.