Primes for proven bases
 

I think it would be interesting to look at distributions of primes of the form k*b^n (+/-) 1. Perhaps some neat results could come out of it. At the least, neat pictures.

The data storage could be minimal if we put aside the gigantic ck numbers.

We've already got tables of b and ck.

Next, put together two other sets of tables (one set for Sierp, one set for Riesel), one for each b, where the columns are:
k, n, doubleCheckedPrime

Where n is the minimum such that k*b^n (+/-) 1 is prime.

And the additional flag is for making sure the primes are actually prime (not too difficult). Double-checking that it's the min n would be a bit more work.

Or stack the tables and throw in a column for b.

If we start with only the proved conjectures, this entire table would only be like 50,000 rows, and I'd be glad to store/host that.

We're doing a ton of work and getting cool results, but I personally would love to be able to play with the data and see what else pops out.

After a few minutes of looking at the b vs. ck tables, for all b up to 1030, it looks like for b = 14 + 15*j, j a natural number, the ck is 4 on both the Sierp and Riesel side. Not sure if anyone noticed this before, or if it's been conjectured/proved in general, but I haven't noticed it through perusing the forum (though I haven't read through all the reservation thread posts). Maybe looking at the distribution of n for k = 2 and k = 3 for those types of bases will provide some cool insights. Maybe not.

There are some other interesting periodic behaviors with other cks, too.

On the proven conjectures page, there's the "largest prime," so I imagine a lot of this information already exists, I'm just not sure where to start consolidating from.

I have attempted to store every prime ever found plus all results (residuals) for n>25K on this project on my laptop. It gets backed up about every 2-3 months on an external hard drive. There are holes of primes that I do not have for some huge conjectured bases like base 3 as well as some others where the primes were posted in the threads here but not copied off to my machine. All of these primes, results, and sieve files are in the 20-25 GB range right now and we haven't even scratched the surface of primes to be found on monsterous conjectured bases like 3, 7, 15, and 280.

The main thing that is needed for historical reference is primes for all k for [I]proven[/I] bases. With the largest conjectured k proven at k<2500, it is a very small amount of data to have all of such primes available. If you would like a list of all primes for any proven base or one in which there are only 1, 2, or 3 k's remaining, I should be able to quickly provide it.

I agree that a doublecheck effort is probably needed at some point but where and how to start such an effort is not something that I care to think about right now.

The 2 main challenges from my perspective on this project have been managing the huge amount of information that comes in and attempting to give the project a direction. Fortunately co-admins and some of our regulars have helped. Mark (rogue) started the 1k base thread and did extensive updates to our stats pages as well as started a mini drive for base S63. Myself and others have helped start and maintain team drives and done large amounts of sieving to keep the drives going.


Gary

For historical reference, attached is a list of all primes for proven bases <= 200.

I've now added primes for proven bases <= 200 to the attachment in the previous post.

The CRUS page only shows the "TOP 10" primes, and I cannot find any information for the smallest n such that 286*19^n+1, 12*282^n+1, 12*457^n+1, etc. is prime, I only know that there is a known prime of this form (since the CRUS page says that they are not remaining), and I cannot see the primes, I hope the CRUS page has a link to the files like them: (including all k<conjectured k, not only k<=500, not only for proven bases, it is for all tested bases, if this k is remaining, the file can list [200K], etc. (only lists the k's such that gcd(k+-1, b-1) = 1 (+ for Sierpinski, - for Riesel))

Something is "odd" there, in R2 and S2 you should not have "even" k's, and also in the other, try keep also gcd(k,b)=1. Any reason why they are kept?

gcd(k,b) does not need to be 1, only gcd(k+-1, b-1) needs to be 1. If gcd(k+-1, b-1) != 1, then this k is a trivial k (all numbers are divisible by a single prime factor)

Besides, when gcd(k,b) != 1, k may not be a multiple of b, for example 7666*10^n+1, gcd(7666,10) = 2, but 7666 is not a multiple of 10. Thus, 7666*10^n+1 needs to be tested.

Even if k is a multiple of b, some k's still need to be tested: (when k+-1 is prime, + for Sierpinski, - for Riesel)

e.g. 6977*2^3+1 is prime, but it is hard to find an n>=1 such that 55816*2^n+1 is prime.

e.g. 337*2^1-1 is prime, but it is hard to find an n>=1 such that 674*2^n-1 is prime.

e.g. 8*5^1+1 is prime, but it is hard to find an n>=1 such that 40*5^n+1 is prime.

e.g. 36*6^2+1 is prime, but it is hard to find an n>=1 such that 1296*6^n+1 is prime.

e.g. 45*10^1-1 is prime, but it is hard to find an n>=1 such that 450*10^n-1 is prime.

e.g. 22*27^1-1 is prime, but it is hard to find an n>=1 such that 594*27^n-1 is prime.

If k is a multiple of b and k+-1 (+ for Sierpinski, - for Riesel) is not prime, then the prime for the k is the same as the prime for k/b. Thus, such k's do not need to be tested.

Ok, understood. A bit bad wording on my side, I wanted to say that you do not need to keep in the list the k's which contain multiplies of b. But I understood the reason meantime, by reading your discussion with Gary in the other thread.

[QUOTE=sweety439;447702]The CRUS page only shows the "TOP 10" primes, and I cannot find any information for the smallest n such that 286*19^n+1, 12*282^n+1, 12*457^n+1, etc. is prime, I only know that there is a known prime of this form (since the CRUS page says that they are not remaining), and I cannot see the primes, I hope the CRUS page has a link to the files like them: (including all k<conjectured k, not only k<=500, not only for proven bases, it is for all tested bases, if this k is remaining, the file can list [200K], etc. (only lists the k's such that gcd(k+-1, b-1) = 1 (+ for Sierpinski, - for Riesel))[/QUOTE]

There are no links to all of the primes for each base. I keep them stored on a lap top and backed up on either an external hard drive or a desktop machine.

[QUOTE=sweety439;447702]The CRUS page only shows the "TOP 10" primes, and I cannot find any information for the smallest n such that 286*19^n+1, 12*282^n+1, 12*457^n+1, etc. is prime, I only know that there is a known prime of this form (since the CRUS page says that they are not remaining), and I cannot see the primes, I hope the CRUS page has a link to the files like them: (including all k<conjectured k, not only k<=500, not only for proven bases, it is for all tested bases, if this k is remaining, the file can list [200K], etc. (only lists the k's such that gcd(k+-1, b-1) = 1 (+ for Sierpinski, - for Riesel))[/QUOTE]

Primes from the CRUS project:

286*19^18524+1
12*282^2956+1
12*457^10023+1

Thanks.

Yesterday, you gave all the Sierpinski primes in the CRUS with k=10. Also, in the other files, you gave all the Sierpinski/Riesel prime (including some not in the CRUS, i.e. the bases not started or the k > conjectured k) for all 2<=k<=7. I also want all 8<=k<=12 (only primes in the CRUS), especially Sierpinski primes with k=12, OK?

Besides, In my research for reverse Sierpinski/Riesel problem for 2<=k<=24, I need these n's of these form, these are the status of this problem: (only for 8<=k<=24, since you had already given the status of 2<=k<=7)

9*244^n+1 (the conjecture of S244 is only 6)
9*248^39510+1 due to the CRUS
9*490^n+1 (S490 has 29 k's remaining at n=100K, but not include 9)
9*544^4705+1 due to the CRUS
9*592^n+1 (S592 has k=9 remaining at n=25K)
9*724^n+1 (S724 has k=9 remaining at n=200K)
9*844^9687+1 due to the CRUS
9*848^n+1 (S848 has 11 k's remaining at n=100K, but not include 9)
9*884^n+1 (the conjecture of S884 is only 4)
9*894^3069+1 due to the CRUS
9*908^n+1 (S908 has 9 k's remaining at n=100K, but not include 9)
9*934^429+1 due to the CRUS
9*974^n+1 (the conjecture of S974 is only 4)
9*984^n+1 (S984 has 6 k's remaining at n=100K, but not include 9)
9*1004^n+1 (the conjecture of S1004 is only 4)
9*1030^n+1 (S1030 has 304 k's remaining at n=25K, but not include 9)

10*17^1356+1 due to the CRUS

12*12^n+1 (it is a GFN)
12*30^1023+1 due to the CRUS
12*65^684+1 (this prime is found by me)
12*68^656921+1 due to the CRUS
12*87^1214+1 due to the CRUS
12*102^2739+1 due to the CRUS

15*398^n+1 (the conjecture of S398 is only 8)
15*496^44172+1 due to the CRUS
15*636^9850+1 due to the CRUS
15*650^n+1 (the conjecture of S650 is only 8)
15*734^n+1 (the conjecture of S734 is only 4)
15*752^1128+1 due to the CRUS
15*846^408+1 due to the CRUS
15*864^51510+1 due to the CRUS
15*874^n+1 (the conjecture of S874 is only 6)
15*876^n+1 (S876 is a non-started base)
15*1014^n+1 (the conjecture of S1014 is only 6)

16*32^n+1 (it is a GFN)

17*68^n+1 (S68 has k=17 remaining at n=1M)
17*218^n+1 (S218 has k=17 remaining at n=200K)

18*18^n+1 (it is a GFN)
18*37^461+1 (this prime is found by me)
18*74^n+1 (the conjecture of S74 is only 4)
18*145^n+1 (S145 has 435 k's remaining at n=25K, but not include 18)
18*157^3873+1 due to the CRUS
18*189^171175+1 due to the CRUS
18*227^n+1 (S227 has k=18 remaining at n=1M)
18*239^n+1 (the conjecture of S239 is only 4)
18*293^n+1 (the conjecture of S293 is only 8)

22*22^n+1 (it is a GFN)

24*45^n+1 (S45 has 36 k's remaining at n=100K, but not include 24)
24*79^n+1 (S79 has k=24 remaining at n=200K)

12*65^n-1 (the conjecture of R65 is only 10)
12*98^n-1 (the conjecture of R98 is only 10)

15*454^n-1 (the conjecture of R454 is only 6)
15*466^n-1 (R466 has 54 k's remaining at n=100K, but not include 15)
15*552^n-1 (R552 has k=15 remaining at n=100K)
15*608^n-1 (the conjecture of R608 is only 8)
15*620^562-1 due to the CRUS
15*718^n-1 (R718 has 22 k's remaining at n=100K, but not include 15)
15*734^n-1 (the conjecture of R734 is only 4)
15*774^1937-1 due to the CRUS
15*828^2308-1 due to the CRUS
15*856^n-1 (R856 is a non-started base)

17*88^n-1 (R88 has 30 k's remaining at n=100K, but not include 17)
17*98^n-1 (the conjecture of R98 is only 10)
17*110^2598-1 due to the CRUS
17*556^n-1 (R556 is a non-started base)
17*650^n-1 (the conjecture of R650 is only 8)
17*662^n-1 (the conjecture of R662 is only 14)
17*686^402-1 due to the CRUS
17*724^1082-1 due to the CRUS
17*734^n-1 (the conjecture of R734 is only 4)
17*766^n-1 (R766 has 6 k's remaining at n=100K, but not include 17)
17*772^n-1 (R772 has 587 k's remaining at n=25K, but not include 17)
17*842^35640-1 due to the CRUS
17*852^n-1 (R852 has 130 k's remaining at n=25Km, but not include 17)
17*988^1275-1 due to the CRUS

22*38^n-1 (the conjecture of R38 is only 13)
22*62^n-1 (the conjecture of R62 is only 8)

24*45^153355-1 due to the CRUS
24*64^3020-1 (this prime is found by me)
24*72^2648-1 due to the CRUS

Also, I am interested in the form k*b^n+-1 with both b and k are small, but it does not have an easy prime of this form. (excluding GFNs)

For example:
47*2^583+1
40*5^1036+1
10*17^1356+1
4*23^342+1
8*23^119215+1
32*26^318071+1
12*30^1023+1
36*33^23615+1
2*38^2729+1
5*14^19698-1
32*26^9812-1
25*30^34205-1
37*38^136211-1

I take all k*b^n+-1 for b<=64, k<=64. However, I cannot find a prime of the form 46*35^n+1, but the file shows that 46 is not a remain k for S35.

These are other text files for S5, S6, R4, R5, and R6, up to k=500. (except R4, since if we allow full/partial algebraic factors, then the conjecture of R4 is only 9)

I am another researcher, I do not exclude k's with full or partial algebraic factors, and I do not exclude GFN's. I want to find the smallest Sierpinski/Riesel number (in my definition) to all bases b<=1024, this is the file for b<=256, but with some question marks, are all the terms right? (I know some special cases for GFN's cannot have a prime, even if they have no algebraic factors, e.g. 8*128^n+1, it equals 2^(7*n+3)+1, and if 2^n+1 is prime, then this n must be a power of 2, but 7*n+3 cannot be a power of 2 since a power of 2 must = (1 or 2 or 4) mod 7, and not = 3 (mod 7). Thus, all number of the form 8*128^n+1 with integer n>=1 are composite)

[QUOTE=sweety439;448086]I am another researcher, I do not exclude k's with full or partial algebraic factors, and I do not exclude GFN's. I want to find the smallest Sierpinski/Riesel number (in my definition) to all bases b<=1024, this is the file for b<=256, but with some question marks, are all the terms right? (I know some special cases for GFN's cannot have a prime, even if they have no algebraic factors, e.g. 8*128^n+1, it equals 2^(7*n+3)+1, and if 2^n+1 is prime, then this n must be a power of 2, but 7*n+3 cannot be a power of 2 since a power of 2 must = (1 or 2 or 4) mod 7, and not = 3 (mod 7). Thus, all number of the form 8*128^n+1 with integer n>=1 are composite)[/QUOTE]

You are free to define the reverse conjectures however you see fit. The efforts are welcome and are interesting. But you come to the CRUS project after it has been running for 9 years and now seem to be attempting to re-define the Riesel and Sierp conjectures using your own definition. With that your efforts are not welcome and have now become irritating. I would ask you to take a step back from such an effort. Defining the reserve conjectures is fine. Re-defining the project conjectures is not.

So that you can see where our conjectures came from, I am attaching a complete listing of all of both the Riesel and Sierp conjectures for bases <= 1024. Included are the base, the conjectured k-value, the period, and the complete covering set. Whenever a new base is started, this is the list that we use. I do not recall who created the lists but it was done programatically by one of our more sophisticated programmers. After 9 years we have yet to find an error in the lists.

[QUOTE=sweety439;448075]Also, I am interested in the form k*b^n+-1 with both b and k are small, but it does not have an easy prime of this form. (excluding GFNs)

For example:
47*2^583+1
40*5^1036+1
10*17^1356+1
4*23^342+1
8*23^119215+1
32*26^318071+1
12*30^1023+1
36*33^23615+1
2*38^2729+1
5*14^19698-1
32*26^9812-1
25*30^34205-1
37*38^136211-1

I take all k*b^n+-1 for b<=64, k<=64. However, I cannot find a prime of the form 46*35^n+1, but the file shows that 46 is not a remain k for S35.[/QUOTE]

prime:
46*35^56062+1

[QUOTE=sweety439;448073]<snip>
9*490^n+1 (S490 has 29 k's remaining at n=100K, but not include 9)
9*848^n+1 (S848 has 11 k's remaining at n=100K, but not include 9)
9*908^n+1 (S908 has 9 k's remaining at n=100K, but not include 9)
9*984^n+1 (S984 has 6 k's remaining at n=100K, but not include 9)
9*1030^n+1 (S1030 has 304 k's remaining at n=25K, but not include 9)
18*145^n+1 (S145 has 435 k's remaining at n=25K, but not include 18)
24*45^n+1 (S45 has 36 k's remaining at n=100K, but not include 24)
15*466^n-1 (R466 has 54 k's remaining at n=100K, but not include 15)
15*718^n-1 (R718 has 22 k's remaining at n=100K, but not include 15)
17*88^n-1 (R88 has 30 k's remaining at n=100K, but not include 17)
17*766^n-1 (R766 has 6 k's remaining at n=100K, but not include 17)
17*772^n-1 (R772 has 587 k's remaining at n=25K, but not include 17)
17*852^n-1 (R852 has 130 k's remaining at n=25K, but not include 17)
[/QUOTE]

Primes:
9*490^468+1
9*848^543+1
9*908^1069+1
9*984^315+1
9*1030^941+1
18*145^6555+1
24*45^18522+1
15*466^776-1
15*718^1948-1
17*88^1362-1
17*766^566-1
17*772^1665-1
17*852^240-1


Sweety, I am happy to look up these primes for you but I feel for your part you should be doing searches to at least n=1000 (preferrably n=5000) before making such requests. Using a PFGW script an entire k-value for one side can be searched for all bases <= 1030 to n=1000 in under an hour. It would only take a few hours to search them to n=5000 on a modern machine. For example on my 10-year old extremely slow laptop I am able to search a single k-value on one side to n=5000 in < 1 day. The only real personal effort involved was to determine the bases to be searched by removing bases with trivial and algebraic factors before beginning the search.

My point here is that if you desire such comprehensive lists of primes for the reverse conjectures you should be willing to put in some effort to learn how a PFGW script works and spend more CPU time than just a cursory search to n=200 (or whatever limit that you are searching to).

I searched to 400. For example, I found the prime 17*554^288-1 (the conjecture of R554 is only 4)

However, for forms that the CRUS says there is a known prime, such as 9*984^n+1, I didn't searched so far.

[QUOTE=sweety439;448156]I searched to 400. For example, I found the prime 17*554^288-1 (the conjecture of R554 is only 4)

However, for forms that the CRUS says there is a known prime, such as 9*984^n+1, I didn't searched so far.[/QUOTE]

Obviously you did not search to n=400. In my most recent post in this thread I gave you two primes that were n<400, the lowest of which was n=240.

Please learn how to use PFGW. I will no longer look up primes for you for n<5000. It is a fast search to n=5000 with PFGW or LLR.

I want the smallest exponent n such that (b-1)*b^n+1 is prime for b = 249, 297, and 498.

Besides, due to the website [URL]http://harvey563.tripod.com/wills.txt[/URL], R268, k=267 is already checked to n=200K with no prime found.

I found the website [URL]http://www.noprimeleftbehind.net/gary/primes-kx10n-1.htm[/URL] for the R10 primes. Of course, there is also a website [URL]http://www.rieselprime.de/[/URL] for the S2 and R2 primes, but why you choose R10? not S10? Besides, why there is no website for all S3 to S12 primes and R3 to R12 primes?

[QUOTE=sweety439;449230]I found the website [URL]http://www.noprimeleftbehind.net/gary/primes-kx10n-1.htm[/URL] for the R10 primes. Of course, there is also a website [URL]http://www.rieselprime.de/[/URL] for the S2 and R2 primes, but why you choose R10? not S10? [/QUOTE]

R 10 is very interesting since it produce near-repdigit primes.
S 10 can only produce quasi repdgiti primes.

[QUOTE=sweety439;449216]I want the smallest exponent n such that (b-1)*b^n+1 is prime for b = 249, 297, and 498.

Besides, due to the website [URL]http://harvey563.tripod.com/wills.txt[/URL], R268, k=267 is already checked to n=200K with no prime found.[/QUOTE]

So find them yourself.

[QUOTE=sweety439;449230]I found the website [URL]http://www.noprimeleftbehind.net/gary/primes-kx10n-1.htm[/URL] for the R10 primes. Of course, there is also a website [URL]http://www.rieselprime.de/[/URL] for the S2 and R2 primes, but why you choose R10? not S10? Besides, why there is no website for all S3 to S12 primes and R3 to R12 primes?[/QUOTE]

Because I didn't want to. If you want them search them yourself.

[QUOTE=gd_barnes;449235]So find them yourself.



Because I didn't want to. If you want them search them yourself.[/QUOTE]

These primes are the smallest primes of the form 248*249^n+1, 296*297^n+1 and 497*498^n+1, they are in the CRUS, but not the top 10 primes. What is the smallest exponent?

Besides, see the link [URL]http://harvey563.tripod.com/wills.txt[/URL], R268, k=267 is already tested to n=200K with no prime found (but the CRUS page only writes n=100K), and for non-started bases, R478, k=477 is already tested to n=200K with no prime found, and R1012, k=1011, the smallest prime is 1011*1012^32693-1.

[QUOTE=gd_barnes;449235]
Because I didn't want to. If you want them search them yourself.[QUOTE=sweety439;449235]
I want the smallest exponent...[/QUOTE][/QUOTE]
[in Jar Jar Binks voice] How wude!
:popcorn:

[QUOTE=gd_barnes;448410]Obviously you did not search to n=400. In my most recent post in this thread I gave you two primes that were n<400, the lowest of which was n=240.

Please learn how to use PFGW. I will no longer look up primes for you for n<5000. It is a fast search to n=5000 with PFGW or LLR.[/QUOTE]

[QUOTE=sweety439;449285]These primes are the smallest primes of the form 248*249^n+1, 296*297^n+1 and 497*498^n+1, they are in the CRUS, but not the top 10 primes. What is the smallest exponent?
[/QUOTE]

At least one of these has a prime for n<5000, which means that you did not make an effort to find it on your own. As shown above I've already stated that I will not provide primes n<5000 for you.

Based on this, I will no longer provide primes of any size for you. You have shown a lack of willingness to use software for your own research.

I suggest that you find a different forum for your postings. I have deleted quite a few of your posts in these threads. I'm close to the point of deleting everything that you post in this forum in the future regardless of whether it is useful or not.

[QUOTE=gd_barnes;449298]At least one of these has a prime for n<5000, which means that you did not make an effort to find it on your own. As shown above I've already stated that I will not provide primes n<5000 for you.

Based on this, I will no longer provide primes of any size for you. You have shown a lack of willingness to use software for your own research.

I suggest that you find a different forum for your postings. I have deleted quite a few of your posts in these threads. I'm close to the point of deleting everything that you post in this forum in the future regardless of whether it is useful or not.[/QUOTE]

I see the past posts, there is no n<=10000 such that 296*297^n+1 is prime, but 296 is not remain at n=25000 for S297. Thus, the smallest exponent should between 10000 and 25000.

Several weeks ago, I searched (b-1)*b^n+1 for all bases 2<=b<=500 to n=1024, but some bases have no prime with n<=1024. I continued to search and found prime 87*88^3022+1, but found no prime of the form 121*122^n+1. (122 is the first base that I cannot find a prime)

[QUOTE=sweety439;449299]I see the past posts, there is no n<=10000 such that 296*297^n+1 is prime, but 296 is not remain at n=25000 for S297. Thus, the smallest exponent should between 10000 and 25000.[/QUOTE]

But there is a prime n<5000 for 248*249^n+1. I challenge you to find it. Hint: Do not use the factordb. You are wasting someone else's resources.

Is it possible for you to learn software? Can you run such software on your machine? Why is this so difficult for you?

Found a prime 248*249^1851+1.

[QUOTE=sweety439;449306]Found a prime 248*249^1851+1.[/QUOTE]

Good. How did you find it?

[QUOTE=gd_barnes;449307]Good. How did you find it?[/QUOTE]

I used my program, I also used this program to find the primes 87*88^3022+1 and 157*158^1620+1, but cannot find a prime of the form 121*122^n+1.

[QUOTE=sweety439;449353]I used my program, I also used this program to find the primes 87*88^3022+1 and 157*158^1620+1, but cannot find a prime of the form 121*122^n+1.[/QUOTE]

Prime for k 121 Base 122:
[CODE]121*122^6216+1[/CODE]Programms used:
srsieve
PFGW

Time: 12 minutes (including setting up srsieve and PFGW).

Sieving with srsieve until p=1G (srsieve --nmin 2 --nmax 25000 --pmax 1e9 "121*122^n+1")
PRP testing with PFGW (input.npg -f30)

There is another project to search the primes of the form (b-1)*b^n-1 for 3<=b<=2049, see the link [URL]http://harvey563.tripod.com/wills.txt[/URL], R268, k=267 is already tested to n=200K with no prime found (but the CRUS page only writes n=100K), and for non-started bases, R478, k=477 is already tested to n=200K with no prime found, and R1012, k=1011, the smallest prime is 1011*1012^32693-1.

You can also see more primes and test limits in the link above. (Some of the primes and test limits are for the k's > conjectured k, e.g. 112*113^286643-1, but the conjecture of R113 is only 20. The page only searches the primes of the form (b-1)*b^n-1)

Did you change the CRUS page? (for the test limit of R268, k=267)

[QUOTE=sweety439;448085]These are other text files for S5, S6, R4, R5, and R6, up to k=500. (except R4, since if we allow full/partial algebraic factors, then the conjecture of R4 is only 9)[/QUOTE]

Now, I agree to the CRUS definition, i.e. not consider the k's with full or partial algebra factors as Sierpinski/Riesel number. Thus, the smallest Riesel number to base 4 should be 39939, not 9. Update the correct R4 primes text file (only up to k=500), also S7, S8, R7, R8 primes text files.

Upload more text files for the primes.

Upload more text files for the primes.

Upload more text files for the primes.

Upload more text files for the primes.

[QUOTE=sweety439;449353]I used my program, I also used this program to find the primes 87*88^3022+1 and 157*158^1620+1, but cannot find a prime of the form 121*122^n+1.[/QUOTE]

What is "your program"? Did you write it yourself? That would be very hard to do.

More and more and more of this s....
 

[QUOTE=sweety439;450336]Found the primes (257-1)*257^1344+1 and (269-1)*269^1436+1, but still cannot find a prime of the form (202-1)*202^n+1.

Continuing... and reserving (272-1)*272^n+1.

Note: According to the CRUS page, (123-1)*123^n+1 is checked to 100000 with no prime found (it is reserved to 250000, see [URL]http://www.mersenneforum.org/showthread.php?t=15830&page=47[/URL], and it is reserved to 400000 to BOINC), and according to the OEIS page [URL]http://oeis.org/A087139[/URL], (251-1)*251^n+1 is checked to 73000 with no prime found.[/QUOTE]

Sweety439 you are such good men ( or woman) I think that Barnes [B]ask you several times not to write what someone is reserved or what is Boinc reserved[/B], but no, you just must write that. If you dont write that we, others, we never know that fact.
When you will stop spam this forum?
When you will stop copying other stuff?
When you leave this forum?
I am sure that even one member of this forum will not noticed when you leave - oh. but no- forum will become clear, without your :poop: , your :poop: research , your :poop: primes....

A ban from CRUS is not too harsh a reaction here, imo. Dude can't follow Gary's guidance, can't learn to use the software tools, posts 10 times too often despite being warned.

Perhaps a week off to start?

[QUOTE=sweety439;450336]Found the primes (257-1)*257^1344+1 and (269-1)*269^1436+1, but still cannot find a prime of the form (202-1)*202^n+1.

Continuing... and reserving (272-1)*272^n+1.

Note: According to the CRUS page, (123-1)*123^n+1 is checked to 100000 with no prime found (it is reserved to 250000, see [URL]http://www.mersenneforum.org/showthread.php?t=15830&page=47[/URL], and it is reserved to 400000 to BOINC), and according to the OEIS page [URL]http://oeis.org/A087139[/URL], (251-1)*251^n+1 is checked to 73000 with no prime found.[/QUOTE]

Yes, I reserved that. I would not reserve bases Sweety it is a huge responsibility to pay. I am sure almost everyone would agree with me here.

[QUOTE=VBCurtis;450357]A ban from CRUS is not too harsh a reaction here, imo. Dude can't follow Gary's guidance, can't learn to use the software tools, posts 10 times too often despite being warned.

Perhaps a week off to start?[/QUOTE]

I'm not sure if the super-mods can ban a person from just one project but I'm in favor of it at this point. I've resorted to deleting quite a few of his posts. I will check with Mike (XYZZY).

Sweety, we are now looking into banning you from CRUS.

[QUOTE=gd_barnes;450361]I'm not sure if the super-mods can ban a person from just one project but I'm in favor of it at this point. I've resorted to deleting quite a few of his posts. I will check with Mike (XYZZY).

Sweety, we are now looking into banning you from CRUS.[/QUOTE]

At last!
I dont know what , and why are you waiting so long?
And please delete those posts, or merge it into one theme and remove it from current threads,that will put forum in clear state before those posts....
Thanks

[QUOTE=pepi37;450365]At last!
I dont know what , and why are you waiting so long?
And please delete those posts, or merge it into one theme and remove it from current threads,that will put forum in clear state before those posts....
Thanks[/QUOTE]

I waited because he did come up with some interesting maths on his own and different ways of looking at things plus he was never rude to anyone; just irritating in the amount of stuff that he posted and the fact that he ignored our suggestions. I think I was never quite as negative about him as some people here. Banning is always a last resort but enough is enough.

[QUOTE=carpetpool;450358]Yes, I reserved that. I would not reserve bases Sweety it is a huge responsibility to pay. I am sure almost everyone would agree with me here.[/QUOTE]

I think he is saying that he reserved single k=271 for base S272 for his own efforts. That's not much responsibility...and it doesn't really apply to us here.

[QUOTE=gd_barnes;450370]I think he is saying that he reserved single k=271 for base S272 for his own efforts. That's not much responsibility...and it doesn't really apply to us here.[/QUOTE]

I see. Now, I know what is not appropriate for CRUS. I will never post those here.