# Primary pseudoperfect number

In mathematics, and particularly in number theory, *N* is a **primary pseudoperfect number** if it satisfies the Egyptian fraction equation

where the sum is over only the prime divisors of *N*.

## Properties[edit]

Equivalently, *N* is a primary pseudoperfect number if it satisfies

Except for the primary pseudoperfect number *N* = 2, this expression gives a representation for *N* as the sum of distinct divisors of *N*. Therefore, each primary pseudoperfect number *N* (except *N* = 2) is also pseudoperfect.

The eight known primary pseudoperfect numbers are

- 2, 6, 42, 1806, 47058, 2214502422, 52495396602, 8490421583559688410706771261086 (sequence A054377 in the OEIS).

The first four of these numbers are one less than the corresponding numbers in Sylvester's sequence, but then the two sequences diverge.

It is unknown whether there are infinitely many primary pseudoperfect numbers, or whether there are any odd primary pseudoperfect numbers.

The prime factors of primary pseudoperfect numbers sometimes may provide solutions to Znám's problem, in which all elements of the solution set are prime. For instance, the prime factors of the primary pseudoperfect number 47058 form the solution set {2,3,11,23,31} to Znám's problem. However, the smaller primary pseudoperfect numbers 2, 6, 42, and 1806 do not correspond to solutions to Znám's problem in this way, as their sets of prime factors violate the requirement that no number in the set can equal one plus the product of the other numbers. Anne (1998) observes that there is exactly one solution set of this type that has *k* primes in it, for each *k* ≤ 8, and conjectures that the same is true for larger *k*.

If a primary pseudoperfect number *N* is one less than a prime number, then *N*×(*N*+1) is also primary pseudoperfect. For instance, 47058 is primary pseudoperfect, and 47059 is prime, so 47058 × 47059 = 2214502422 is also primary pseudoperfect.

## History[edit]

Primary pseudoperfect numbers were first investigated and named by Butske, Jaje, and Mayernik (2000). Using computational search techniques, they proved the remarkable result that for each positive integer *r* up to 8, there exists exactly one primary pseudoperfect number with precisely *r* (distinct) prime factors, namely, the *r*th known primary pseudoperfect number. Those with 2 ≤ *r* ≤ 8, when reduced modulo 288, form the arithmetic progression 6, 42, 78, 114, 150, 186, 222, as was observed by Sondow and MacMillan (2017).

## See also[edit]

## References[edit]

- Anne, Premchand (1998), "Egyptian fractions and the inheritance problem",
*The College Mathematics Journal*, Mathematical Association of America,**29**(4): 296–300, doi:10.2307/2687685, JSTOR 2687685.

- Butske, William; Jaje, Lynda M.; Mayernik, Daniel R. (2000), "On the equation , pseudoperfect numbers, and perfectly weighted graphs",
*Mathematics of Computation*,**69**: 407–420, doi:10.1090/S0025-5718-99-01088-1.

- Sondow, Jonathan; MacMillan, Kieren (2017), "Primary pseudoperfect numbers, arithmetic progressions, and the Erdős-Moser equation",
*The American Mathematical Monthly*,**124**(3): 232–240, arXiv:1812.06566, doi:10.4169/amer.math.monthly.124.3.232.