20190520, 23:10  #1 
"Kebbaj Reda"
May 2018
Casablanca, Morocco
5E_{16} Posts 
Primes Arithmetic Progression >1000 Digits
I would like to make a page of reporting prime numbers in
Aritmetic Progression > 1000 digits, here is an example: 0 : 2699# *(41637800*1996857)+2729 Prime 1 : 2699# *(41637801*1996857)+2729 Prime 2 : 2699# *(41637802*1996857)+2729 Prime 3 : 2699# *(41637803*1996857)+2729 Prime 4163780*2699#+2729 AP term 4 difference 1996857*2699# 
20190520, 23:44  #2  
Sep 2002
Database er0rr
3853_{10} Posts 
Quote:
AP5 1,020,833,527 AP6 7,270,362 AP7 63,368 AP8 336 AP9 5 (Not disjoint.) Here is the top5000 top5 APs over the years: Last fiddled with by paulunderwood on 20190520 at 23:52 

20190521, 23:40  #3  
"Kebbaj Reda"
May 2018
Casablanca, Morocco
2·47 Posts 
Quote:
Your work is fabulous with Ken Davis. In particular, you have shelled the 2371 #. I have a small question if you can inform me: I saw that you are working with newpgen for the sieve. Newpgen can do k * b # + 1 because this form does not need primo for certification. but I would like to make the sieve of k * b # + n. Like my exemple 4163780 * 2699 # + 2729. Are you familiar with a program that can sive it? Thank you. 

20190522, 02:44  #4  
Sep 2002
Database er0rr
3,853 Posts 
Quote:
Last fiddled with by paulunderwood on 20190522 at 02:47 

20190523, 00:34  #5 
"Kebbaj Reda"
May 2018
Casablanca, Morocco
5E_{16} Posts 
I took only the primorial form k*p#+1 on top5000AP.txt tanks paul,
the attached files. one litle error: Code p46 in the year 2000 : d=36364*5000# d=187314*5000# d=457410*5000# 5000# should be 4999#. 
20190523, 02:10  #6 
Sep 2002
Database er0rr
3,853 Posts 

20190523, 17:22  #7  
Jun 2009
1010101110_{2} Posts 
Quote:
The gmp version of polysieve should be rather easy to adapt. It is not originally written for this kind of task, but with the correct input it will be doing this. The major modification will be calculating the primorial as it is not doing primorials at the moment. But that shouldn't be too hard. 

20190525, 09:06  #8  
"Kebbaj Reda"
May 2018
Casablanca, Morocco
136_{8} Posts 
Quote:
I downloaded polysieve. But I look for documentation. I dont find it. 

20190526, 18:25  #9 
Jun 2009
2·7^{3} Posts 
I'm afraid there is no documentation apart from what you find in the code.
Just to make sure: What is the running variable in your example? 
20190602, 22:34  #10 
"Kebbaj Reda"
May 2018
Casablanca, Morocco
1011110_{2} Posts 
Congrats to Serge Batalov for a record.
Congrats to Serge Batalov for a record :
Chaîne Cunningham 2ème type (8p  7) 2072453060816*7699#+1 (3316 digits). Serge you are the best!! Reda kebbaj. 
20210907, 09:58  #11 
Jun 2009
2×7^{3} Posts 
I gave it a try and I found an AP6 with 10593 decimal digits:
N=(2,738,129,976+n*56,497,325)*24499#+1 for n=0..5 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
primes : 270*(1000^11)/999+1  enzocreti  enzocreti  6  20190509 12:52 
Bertrand's Theorem for Arithmetic Progression  literka  Math  0  20130601 12:42 
sieving primes in arithmetic progressions  maxal  Software  18  20101004 17:11 
nth prime number in an arithmetic progression  Unregistered  Information & Answers  1  20100404 22:06 
Arithmetic and Polynomial Progression of Primes?  drake2  Math  13  20061010 00:43 