mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2016-01-16, 11:54   #1
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

22·32·179 Posts
Default A meaningless curiosity

Code:
36468:2513 = 2^4*31*1859347420261560325423336926156329967468978997904111853993329014755200016908884287332630794654761631288131052235930098228067
36468:2514 = 2^4*31*1859347420261560325423336926156329967468978997904111853993329014755200016908884287332630794654761631288131052235930098228069
Sadly the next line has 2^4*3*31 rather than losing the driver. I haven't seen one of these before - driver*p is relatively rare, 124-digit twin primes are relatively rare, so getting both at once is quite unlikely.
fivemack is offline   Reply With Quote
Old 2016-01-16, 17:17   #2
garambois
 
garambois's Avatar
 
"Garambois Jean-Luc"
Oct 2011
France

22·32·19 Posts
Smile

Nice !
garambois is online now   Reply With Quote
Old 2016-01-17, 07:44   #3
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

2×4,903 Posts
Default

Nice, I thing this is the record for the "highest twin primes found in an aliquot sequence" (of course, non trivial cases)
LaurV is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
[Patch] Fix meaningless (char (*)[13]) to (char *) cast Explorer09 Software 3 2017-03-01 09:55
Results Curiosity Gordon PrimeNet 1 2015-07-30 06:49
A Curiosity R.D. Silverman GMP-ECM 4 2012-05-10 20:00
P-1 question of curiosity JuanTutors Math 3 2004-10-20 04:37
Curiosity ET_ Math 7 2004-02-13 17:36

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


Sat Nov 27 18:30:10 UTC 2021 up 127 days, 12:59, 0 users, load averages: 1.19, 1.06, 1.09

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.