mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 7 of 7
Search took 0.00 seconds.
Search: Posts Made By: Trilo
Forum: Riesel Prime Search 2017-08-06, 07:53
Replies: 1,944
Views: 160,986
Posted By Trilo
Since we are on the subject of consecutive large...

Since we are on the subject of consecutive large primes with small n gaps, here is a pair I found a while back:

1423*2^2179023-1
1423*2^2178363-1

The most interesting thing about this pair is...
Forum: Riesel Prime Search 2017-07-27, 04:57
Replies: 1,944
Views: 160,986
Posted By Trilo
9075*2^1331605-1 is prime! (400,858 digits)

9075*2^1331605-1 is prime! (400,858 digits)
Forum: Riesel Prime Search 2017-07-26, 14:06
Replies: 1,944
Views: 160,986
Posted By Trilo
2955*2^1582609-1 is prime (476417 digits)

2955*2^1582609-1 is prime (476417 digits)
Forum: Riesel Prime Search 2017-07-24, 13:15
Replies: 1,944
Views: 160,986
Posted By Trilo
2745*2^1449470-1 (436338 digits)

2745*2^1449470-1 (436338 digits)
Forum: Riesel Prime Search 2015-10-23, 19:57
Replies: 1,944
Views: 160,986
Posted By Trilo
1423*22178363- 1 is prime (655,756 digits) ...

1423*22178363- 1 is prime (655,756 digits)
1423*22179023- 1 is prime (655,955 digits)

Very interesting small gap between the 2 primes with n so large. k=1423 also has a very low nash weight of...
Forum: Riesel Prime Search 2014-10-03, 00:40
Replies: 1,944
Views: 160,986
Posted By Trilo
low weight k prime: 1423*2^1205415-1 (362, 870...

low weight k prime: 1423*2^1205415-1 (362, 870 digits)
Forum: Riesel Prime Search 2014-06-01, 04:09
Replies: 1,944
Views: 160,986
Posted By Trilo
6555*2^1254508-1 is prime (377,649 digits)

6555*2^1254508-1 is prime (377,649 digits)
Showing results 1 to 7 of 7

 
All times are UTC. The time now is 16:00.

Mon Apr 6 16:00:21 UTC 2020 up 12 days, 13:33, 2 users, load averages: 2.37, 2.10, 2.04

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.