Primary pseudoperfect number

Primary pseudoperfect number

In mathematics, and particularly in number theory, a primary pseudoperfect number is a number "N" that satisfies the Egyptian fraction equation:sum_{p|N}frac1p + frac1N = 1,where the sum is over only the prime divisors of "N". Equivalently (as can be seen by multiplying this equation by "N"),:sum_{p|N}frac{N}p + 1 = N.Except for the exceptional primary pseudoperfect number 2, this expression gives a representation for "N" as a sum of a set of distinct divisors of "N"; therefore each such number (except 2) is pseudoperfect.

Primary pseudoperfect numbers were first investigated and named by Butske, Jaje, and Mayernik (2000). The first few primary pseudoperfect numbers are:2, 6, 42, 1806, 47058, 2214502422, 52495396602, ... OEIS|id=A054377.The first four of these numbers are one less than the corresponding numbers in Sylvester's sequence but later numbers in Sylvester's sequence do not similarly correspond to primary pseudoperfect numbers. 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 may provide solutions to Znám's problem in which all members of the solution set are prime. For instance, the factors of the primary pseudoperfect number 47058 are 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 in Znám's problem that no number in the set can equal one plus the product of all 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.

See also Giuga number.

References

* citation
last = Anne | first = Premchand
title = Egyptian fractions and the inheritance problem
journal = The College Mathematics Journal
volume = 29
issue = 4
year = 1998
pages = 296–300
doi = 10.2307/2687685
.

* citation
last1 = Butske | first1 = William | last2 = Jaje | first2 = Lynda M. | last3 = Mayernik | first3 = Daniel R.
title = On the equation scriptstylesum_{p|N}frac{1}{p}+frac{1}{N}=1, pseudoperfect numbers, and perfectly weighted graphs
journal = Mathematics of Computation
volume = 69
year = 2000
pages = 407–420
doi = 10.1090/S0025-5718-99-01088-1
.

External links

*
*


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • 40000 (number) — Number number = 40000 range = 10000 100000 cardinal = 40000 ordinal = th ordinal text = thirty thousandth factorization = 2^6 cdot 5^4 bin = 1001110001000000 oct = 116100 hex = 9C4040,000 (forty thousand) is the number that comes after 39,999 and …   Wikipedia

  • Semiperfect number — In mathematics, a semiperfect number or pseudoperfect number is a natural number n that is equal to the sum of all or some of its proper divisors.The first few semiperfect numbers are:6, 12, 18, 20, 24, 28, 30, 36, 40, ... OEIS|id=A005835;every… …   Wikipedia

  • 1000 (number) — List of numbers Integers ← 1k 2k 3k 4k 5k 6k 7k 8k 9k → Cardinal 1000 one thousand …   Wikipedia

  • 42 (number) — ← 41 43 → 42 ← 40 41 42 43 44 45 46 …   Wikipedia

  • 1000000000 (number) — List of numbers – Integers 100000000 1000000000 10000000000 Cardinal One billion (short scale) One thousand million (long scale) Ordinal One billionth (short scale) Factorization 29 · 59 Binary 111011100110101100101000000000 He …   Wikipedia

  • Egyptian fraction — An Egyptian fraction is the sum of distinct unit fractions, such as frac{1}{2}+ frac{1}{3}+ frac{1}{16}. That is, each fraction in the expression has a numerator equal to 1 and a denominator that is a positive integer, and all the denominators… …   Wikipedia

  • Znám's problem — In number theory, Znám s problem asks which sets of k integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám s problem is named after the Slovak mathematician… …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Sylvester's sequence — In number theory, Sylvester s sequence is a sequence of integers in which each member of the sequence is the product of the previous members, plus one. The first few terms of the sequence are::2, 3, 7, 43, 1807, 3263443, 10650056950807,… …   Wikipedia

  • Suite de Sylvester — Démonstration graphique de la convergence vers 1 de la somme 1/2 + 1/3 + 1/7 + 1/43 +... Chaque rang de n carrés de côté 1/n a une aire totale de 1/n ; l ensemble des rangs recouvre exactement un carré plus grand, d aire 1. [Les carrés de… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”