Primary pseudoperfect number
In mathematics, and particularly in number theory, N is a primary pseudoperfect number if it satisfies the Egyptian fraction equation : \frac{1}{N} + \sum_{p \,|\;\!
≈ 2 min read
Primary pseudoperfect number. encyclopegia.org, snapshot enwiki-001366717267. /a/primary-pseudoperfect-number
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, and particularly in number theory, N is a primary pseudoperfect number if it satisfies the Egyptian fraction equation \frac{1}{N} + \sum_{p \,|\;\! N}\frac{1}{p} = 1, where the sum is over only the prime divisors of N. 1 + \sum_{p \,|\;\!
N} \frac{N}{p} = N. 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 ten known primary pseudoperfect numbers are 2, 6, 42, 1806, 47058, 2214502422, 52495396602, 5998279018951962402, 8490421583559688410706771261086, 35979351189199316534587473905773572006 .
The first four of these numbers are one less than the corresponding numbers in Sylvester's sequence, but then the two sequences diverge. The two largest known primary pseudoperfect numbers may be out of order. 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. 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.
References
. . . .
Text derived from https://en.wikipedia.org/w/index.php?oldid=1366717267 under CC BY-SA 4.0; modifications have been made.