Thread for posting tiny primes

[3.14159]

However; Continuing on with the collection of k * 1296ⁿ + 1 numbers; I'm up to n = 345.

And; Based on the (PFGW) scripts I've seen before;

I'm unable to write it.

To the contrary, I think I might be able to pull it off. (Well, at least making the variables, I can do.)

[mdettweiler]

Originally Posted by 3.14159

For 10¹²²⁸⁸ + 1; Does one of these numbers divide it?

Checked with PFGW (command "-f -s40961 -e32751617 -q10^12288+1")--none of them divide the number.

[3.14159]

What I can think of so far;

DIM min_k,1
DIM max_k,10000
DIM base,1296
DIM min_n,1
DIM max_n,1500

So far, that is designated for the generalized Proth numbers.

All that is needed are a few changes to Karsten's script; Made a copy in order to make the changes.

[science_man_88]

Originally Posted by mdettweiler

Checked with PFGW (command "-f -s40961 -e32751617 -q10^12288+1")--none of them divide the number.

can you point me towards something with a list of commands for it maybe then i can figure stuff out lol.

[3.14159]

So; next, after setting up the variables..

The next easiest part; Variables to be used.

[kar_bon]

Another help here:

Create a file called 'test.txt' with

ABC2 $a*1296^$b+1
a: from 1 to 10000
b: from 1 to 100

Call "pfgw.exe -l -f test.txt".

This will create files "pfgw-prime.log" containing all primes, "pfgw.log" with all PRPs "pfgw.out" with all tests (small factors or PRP-tests).

The above script will test your k*1296^n+1 with 1<=k<=10000 and 1<=n<=100.
It's done in about 10 min.

[3.14159]

Thanks; I'll use it to get to n = 500.

[science_man_88]

Originally Posted by 3.14159

Thanks; I'll use it to get to n = 500.

hey Pi your kbb database could use a similar code I changed one thing and I'm checking k up to 10000 and b upto 100

[3.14159]

Originally Posted by science_man_88

hey Pi your kbb database could use a similar code I changed one thing and I'm checking k up to 10000 and b upto 100

We have checked all bases under 1000. I collected for all bases less than 750. However, I made errors everywhere.

[3.14159]

For the collection of base 1296 primes for small k-values; I have collected all primes for n < 410, where k is between 1 and 10000.

[axn]

Originally Posted by 3.14159

For 10¹²²⁸⁸ + 1; Does one of these numbers divide it?

It has an algebraic factor