mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > sweety439

Reply
 
Thread Tools
Old 2020-12-23, 00:16   #1167
sweety439
 
Nov 2016

2,819 Posts
Default

Quote:
Originally Posted by sweety439 View Post
S81 reserving to n=5000

this file is the currently status for n<=2000

Note:

All k=4*q^4 for all n:
let k=4*q^4and let m=q*3^n; factors to:
(2*m^2 + 2m + 1) * (2*m^2 - 2m + 1)

This includes k = 4, 64, 324
S81 tested to n=5000

primes found for n = 1000-5000: (41*81^1223+1)/2, (75*81^3309+1)/4, (284*81^1455+1)/5, (439*81^2097+1)/40, (569*81^2937+1)/10

additional primes not in the list: (311*81^7834+1)/8, 558*81^51992+1

remain k: 239, 335, 514
Attached Files
File Type: txt S81 status.txt (3.9 KB, 28 views)
sweety439 is offline   Reply With Quote
Old 2020-12-23, 00:18   #1168
sweety439
 
Nov 2016

2,819 Posts
Default

S97 tested to n=2000

Unfortunately, no primes found for n = 1000-2000
Attached Files
File Type: txt S97 status.txt (806 Bytes, 27 views)
sweety439 is offline   Reply With Quote
Old 2020-12-23, 00:36   #1169
sweety439
 
Nov 2016

2,819 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Reserve R/S 40

Update sieve files.
Update current status file for R/S 40
Attached Files
File Type: log pfgw.log (8.5 KB, 27 views)
sweety439 is offline   Reply With Quote
Old 2020-12-23, 04:20   #1170
ONeil
 
Dec 2017

111100002 Posts
Default

@sweety439

Do you know of a fast test for large Mersenne Primes which would suggest it true to be prime?

and say I put in a large number and it was not a prime would the test report back false and can the test do it in under 10 seconds. I have looked a Miller Rabin tests but they don't seem to handle really large numbers.

I'm just looking for some python code which could report back like in a few seconds if a number a huge number could be prime?

Thanks for your time :)
ONeil is offline   Reply With Quote
Old 2020-12-23, 06:25   #1171
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

2·4,787 Posts
Default


Uncwilly is offline   Reply With Quote
Old 2020-12-23, 11:36   #1172
sweety439
 
Nov 2016

2,819 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Code:
1,1171
2,1
3,2
4,5
5,1
6,1
7,26
8,2
9,1
10,4
11,2
12,1
13,1
14,1
15,4
16,(partial algebra factors)
17,11
18,569
19,2
20,1
21,3
22,1
23,6
24,5
25,317
26,13
27,[remain]
28,1
29,697
30,1
31,2
32,[remain]
With CK=33

All k where k = m^2 and m = = 4 or 13 mod 17:
for even n let k = m^2 and let n = 2*q; factors to:
(m*135^q - 1) * (m*135^q + 1)
odd n:
factor of 17

This includes k = 16

k = 27, 32 remain at n=2000
Found primes:

(27*135^3250-1)/2
32*135^2091-1

R135 is proven

Last fiddled with by sweety439 on 2020-12-23 at 11:36
sweety439 is offline   Reply With Quote
Old 2020-12-23, 11:39   #1173
sweety439
 
Nov 2016

281910 Posts
Default

Quote:
Originally Posted by ONeil View Post
@sweety439

Do you know of a fast test for large Mersenne Primes which would suggest it true to be prime?

and say I put in a large number and it was not a prime would the test report back false and can the test do it in under 10 seconds. I have looked a Miller Rabin tests but they don't seem to handle really large numbers.

I'm just looking for some python code which could report back like in a few seconds if a number a huge number could be prime?

Thanks for your time :)
I use PARI/GP ispseudoprime, and for larger numbers, I use PFGW
sweety439 is offline   Reply With Quote
Old 2020-12-23, 12:28   #1174
sweety439
 
Nov 2016

281910 Posts
Default

Reserve:

S108 k = 20543
R108 k = 5351, 6528, 13162

(the k for R/S 108 which is not in CRUS)
sweety439 is offline   Reply With Quote
Old 2020-12-23, 13:35   #1175
sweety439
 
Nov 2016

2,819 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Reserve:

S108 k = 20543
R108 k = 5351, 6528, 13162

(the k for R/S 108 which is not in CRUS)
(20543*108^3375+1)/107 is prime

3 k's for R108 are still remain ....
sweety439 is offline   Reply With Quote
Old 2020-12-23, 13:38   #1176
sweety439
 
Nov 2016

2,819 Posts
Default

Quote:
Originally Posted by sweety439 View Post
Tested R63, completed to n=2000

I will completed all (Riesel or Sierpinski) bases with small CK and only tested to n=1000, to n=2000, this includes bases R63, R127, S63, S81, S97, S106
S106 completed to n=2000

Now all are completed to n>=2000 except R127
Attached Files
File Type: txt S106 status.txt (18.1 KB, 28 views)
sweety439 is offline   Reply With Quote
Old 2020-12-23, 14:13   #1177
sweety439
 
Nov 2016

54038 Posts
Default

Quote:
Originally Posted by sweety439 View Post
https://docs.google.com/document/d/e...7wgHppPnpz/pub

Update the file of Riesel conjectures to include the newest test limit of R2
Redone the file, add the missing Enter character for top 10 k for R2

https://docs.google.com/document/d/e...LOSE6gqDrR/pub
sweety439 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
The dual Sierpinski/Riesel problem sweety439 sweety439 14 2021-02-15 15:58
Semiprime and n-almost prime candidate for the k's with algebra for the Sierpinski/Riesel problem sweety439 sweety439 11 2020-09-23 01:42
The reverse Sierpinski/Riesel problem sweety439 sweety439 20 2020-07-03 17:22
Sierpinski/ Riesel bases 6 to 18 robert44444uk Conjectures 'R Us 139 2007-12-17 05:17
Sierpinski/Riesel Base 10 rogue Conjectures 'R Us 11 2007-12-17 05:08

All times are UTC. The time now is 08:14.

Fri May 14 08:14:55 UTC 2021 up 36 days, 2:55, 0 users, load averages: 1.53, 1.50, 1.54

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.