PG PRIMES
 

[URL]https://solutionsti360.ca/MATH/pfgw/stats.html[/URL]
At this link you can join in the ec-primes search.

[QUOTE=enzocreti;492374][URL]https://solutionsti360.ca/MATH/pfgw/stats.html[/URL]
At this link you can join in the ec-primes search.[/QUOTE]

What software is being used for the prp tests? It would be possible to use pfgw based on a script for this form.

[QUOTE=henryzz;492378]What software is being used for the prp tests? It would be possible to use pfgw based on a script for this form.[/QUOTE]

They are using pfgw. Do you know if it is multithreaded, can’t see anything on the txt documents.

Why is this project so slow?

Even one computer is enough to quickly find:
(2^75894-1)*10^22847+2^75893-1
(2^79798-1)*10^24022+2^79797-1
(2^92020-1)*10^27701+2^92019-1
...

What's more - these are known to FactorDB for months (since March).
________________

Ah, there it is [URL]https://oeis.org/A301806[/URL]


2, 3, 4, 7, 8, 12, 19, 22, 36, 46, 51, 67, 79, 215, 359, 394, 451, 1323, 2131, 3336, 3371, 6231, 19179, 39699, 51456, 56238, 69660, 75894, 79798, 92020, 174968, 176006, 181015, 285019, 331259

[QUOTE=Batalov;492439]Why is this project so slow?

Even one computer is enough to quickly find:
(2^75894-1)*10^22847+2^75893-1
(2^79798-1)*10^24022+2^79797-1
(2^92020-1)*10^27701+2^92019-1
...

What's more - these are known to FactorDB for months (since March).
________________

Ah, there it is [URL]https://oeis.org/A301806[/URL]


2, 3, 4, 7, 8, 12, 19, 22, 36, 46, 51, 67, 79, 215, 359, 394, 451, 1323, 2131, 3336, 3371, 6231, 19179, 39699, 51456, 56238, 69660, 75894, 79798, 92020, 174968, 176006, 181015, 285019, 331259[/QUOTE]


yes I found that values, but I have yet not found a probable prime congruent to 6 (mod 7)

So, these are not EC primes.

Rather they are PG primes, aren't they?

[QUOTE=Batalov;492473]So, these are not EC primes.

Rather they are PG primes, aren't they?[/QUOTE]


Yes Enzo Creti is just a pseudonime

pg primes !!!
 

pg(k) are numbers of the form =(2^k-1)*10^d+2^(k-1)-1 where d is the number of decimal digits of 2^(k-1)-1.


The k for wich pg(k) is prime are:


2, 3, 4, 7, 8, 12, 19, 22, 36, 46, 51, 67, 79, 215, 359, 394, 451, 1323, 2131, 3336, 3371, 6231, 19179, 39699, 51456, 56238, 69660, 75894, 79798, 92020, 174968, 176006, 181015, 285019, 331259, 360787, 366770


I call a(1)=2, a(2)=3 a(3)=4 a(4)=7...the terms of the sequence


Now look at a(7s)'s


a(7)=19 is prime
a(14)=215 is a multiple of 215
a(21)=3371 is prime
a(28)=75894 is -1 (mod 215)
a(35)=331259 is prime


They seem not random at all!!!

I moved this to your blog area.

[B][SIZE="3"][COLOR="Red"]Keep your stuff there. You have been previously warned to not post your every thought elsewhere in the forum. If you don't behave, you can lose your posting privileges.[/COLOR][/SIZE][/B]

:ban::ban:

[QUOTE=Uncwilly;516022]I moved this to your blog area.

[B][SIZE="3"][COLOR="Red"]Keep your stuff there. You have been previously warned to not post your every thought elsewhere in the forum. If you don't behave, you can lose your posting privileges.[/COLOR][/SIZE][/B]

:ban::ban:[/QUOTE]

sorry

[QUOTE=enzocreti;516015]pg(k) are numbers of the form =(2^k-1)*10^d+2^(k-1)-1 where d is the number of decimal digits of 2^(k-1)-1.[/QUOTE]

Reducing the number of variables (but increasing the complexity), this is:

[TEX](2^k-1)(10^ {\lfloor{1+log_{10}{(2^{k-1}-1)}}\rfloor})+2^{k-1}-1[/TEX]