mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2011-02-21, 03:52   #1
schickel
 
schickel's Avatar
 
"Frank <^>"
Dec 2004
CDP Janesville

84A16 Posts
Talking I thought I found another one.....

I found another sequence in the DB that had apparently caught the downdriver with work done by the DB workers (283128):
Code:
 765 .   c108 = 2^5 * 257 * 11084709169 * 175190707343 * 88409477884017188893 * 273383990894380061173393 * 1837537945774841095624053873912479233661
 766 .   c108 = 2^5 * 21642586262122172398892495689973898300074750059148585847100427157850549404643810359165537127305882738713929
 767 .   c108 = 2 * 1663 * 3803 * 692782283479889 * c86
So I figured I'd run it to see where it went.....
Code:
 767 .   c108 = 2 * 1663 * 3803 * 692782283479889 * 73196079065060855437094269607 * 1046014464770935446796211903767846535468020570078246600873
 768 .   c108 = 2 * 168165016845701202345205314212783984349777297230483634511000847305542055240555264759697864684384464329407989
 769 .   c108 = 2^3 * 7 * 11 * 3873731 * 8331230021 * 160919748811917749 * 63665438999503946723151490121728997 * 825663857987977468639836864913012429
schickel is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime number thought experiment MooMoo2 Lounge 59 2018-01-02 18:37
The bandwidth bottleneck is apparently much older than I thought Dubslow Hardware 5 2017-11-16 19:50
Just a thought of Quark numbers. SarK0Y Miscellaneous Math 44 2011-11-07 18:01
A real GIMPS math thought davieddy Math 45 2011-06-06 01:58
MPrime: K7 has 64KB of L1 cache... but I thought it had 128K! optim Hardware 2 2004-07-10 19:59

All times are UTC. The time now is 21:44.

Tue Sep 29 21:44:25 UTC 2020 up 19 days, 18:55, 0 users, load averages: 1.69, 1.66, 1.69

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.