[Search for users]
[Overall Top Noters]
[List of all Conferences]
[Download this site]
| Title: | Mathematics at DEC |
|
| Moderator: | RUSURE::EDP |
|
| Created: | Mon Feb 03 1986 |
| Last Modified: | Fri Jun 06 1997 |
| Last Successful Update: | Fri Jun 06 1997 |
| Number of topics: | 2083 |
| Total number of notes: | 14613 |
348.0. "sum of prime power divisors" by TOOLS::STAN () Thu Oct 17 1985 14:22
(Paul Erdos)
Let f(n) = SUM p^a where the sum is taken over the prime divisors of n,
and p^a is the highest power of p less than n, i.e. n/p <= p^a < n.
Can f(n)=n? The number of distinct primes dividing n must be odd and >1.
[Guy noticed that 2^3 . 3 . 19 = 228 = 2^7 + 3^4 + 19 and wonders if there
are "multiperfect" such numbers with f(n)=kn.]
| T.R | Title | User | Personal
Name | Date | Lines
|
|---|