![]() |
![]() |
#1 |
(loop (#_fork))
Feb 2006
Cambridge, England
7×911 Posts |
![]()
Among sequences containing only numbers less than 1.2e8, we have one of length 93 starting at 67825288 and ending in 6, and one of length 83 starting at 66499496 and ending in 8128.
Ending in 496 seems harder (89416431, of length 10, is the longest under those conditions), because the only permissible remotely-long trail is via 607^2 608 652 492. Goldbach's Conjecture obviously lets you write arbitrarily long sequences if you're allowed arbitrarily large odd numbers (find p+q=N-1 with p,q prime; then the predecessor is pq) No aliquot sequence ends in 28. I can't find a predecessor for 33550336 other than 44655764, and I can't find a predecessor for 44655764. Last fiddled with by fivemack on 2014-12-23 at 09:48 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Is this a Perfect Number ? | Godzilla | Miscellaneous Math | 8 | 2016-09-05 05:56 |
Odd Perfect Number is 36k+9 ? | isaac | Miscellaneous Math | 5 | 2014-07-22 22:18 |
perfect number proof | toilet | Homework Help | 12 | 2012-10-17 13:42 |
Odd Perfect Number, when will numbers go beyond ecm? | jasong | Factoring | 1 | 2006-05-14 11:28 |
What's up with the odd perfect number server? | jasong | GMP-ECM | 6 | 2006-02-18 02:42 |