mersenneforum.org  

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

Reply
 
Thread Tools
Old 2019-04-08, 12:54   #1
enzocreti
 
Mar 2018

2×263 Posts
Default a 27 digit twin prime pair

I found this pair of 27 digit twin primes:


1- 149907114776274341482621993
2- 149907114776274341482621991




I would know if it is possible with Pari or Pfgw to find the next and the previous pair of twin primes?
enzocreti is offline   Reply With Quote
Old 2019-04-08, 13:47   #2
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
Jun 2011
Thailand

212478 Posts
Default

Yes, it is possible, and it takes less than a second to run.


Code:
gp > n=149907114776274341482621993; while((m=nextprime(n+1))-n>2, n=m); n
%1 = 149907114776274341482622207

The other direction exercise for you.
LaurV is offline   Reply With Quote
Old 2019-04-08, 15:25   #3
enzocreti
 
Mar 2018

52610 Posts
Default 149907114776274341482621993

149907114776274341482621993 is the concatenation in base ten of the prime factors of 25!-1
enzocreti is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
find very easy twin prime in the infamy twin primes hal1se Miscellaneous Math 13 2018-11-05 16:34
Highest Prime is also a twin prime... NOT hydeer Lone Mersenne Hunters 9 2018-04-03 22:54
Twin Prime Days, Prime Day Clusters cuBerBruce Puzzles 3 2014-12-01 18:15
What to do with 16 digit twin, non-Mersenne primes? RienS Miscellaneous Math 15 2014-11-18 01:48
Twin primes in the 50,000 digit range? Joshua2 Math 15 2005-06-11 18:46

All times are UTC. The time now is 12:30.

Tue Oct 27 12:30:44 UTC 2020 up 47 days, 9:41, 0 users, load averages: 2.05, 1.72, 1.68

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.