PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
primary pseudoperfect number (Definition)

Given an integer $ n$ with $ \omega(n)$ distinct prime factors $ p_i$ (where $ \omega$ is number of distinct prime factors function), if the equality

$\displaystyle \frac1n + \sum_{i = 1}^{\omega(n)} \frac1{p_i} = 1$
holds true, then $ n$ is a primary pseudoperfect number. Equivalently,
$\displaystyle 1 + \sum_{i = 1}^{\omega(n)} \frac{n}{p_i} = n$
if $ n$ is a primary pseudoperfect number.

The first few primary pseudoperfect numbers are 2, 6, 42, 1806, 47058, 2214502422, 52495396602, 8490421583559688410706771261086, the first four of these being each one less than the first four terms of Sylvester's sequence; these are listed in A054377 of Sloane's OEIS. Presently it's not known whether there are any odd primary pseudoperfect numbers.



"primary pseudoperfect number" is owned by CompositeFan. [ full author list (2) | owner history (1) ]
(view preamble | get metadata)

View style:

See Also: Giuga number

Log in to rate this entry.
(view current ratings)

Cross-references: odd, OEIS, Sylvester's sequence, terms, equality, number of distinct prime factors function, prime factors, integer
There are 2 references to this entry.

This is version 3 of primary pseudoperfect number, born on 2006-10-02, modified 2006-10-16.
Object id is 8413, canonical name is PrimaryPseudoperfectNumber.
Accessed 898 times total.

Classification:
AMS MSC11D85 (Number theory :: Diophantine equations :: Representation problems)

Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)