
In this paper, we introduce the concept of F-perfect number, which is a positive integer n such that ∑d|n,d<n d2 = 3n. We prove that all the F-perfect numbers are of the form n = F2k-1 F2k+1, where both F2k-1 and F2k+1 are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers.
Mathematics - Number Theory, 11B83, 11D09, 11D25, FOS: Mathematics, Number Theory (math.NT), Primary 11B83, Secondary 11D09, 11D25
Mathematics - Number Theory, 11B83, 11D09, 11D25, FOS: Mathematics, Number Theory (math.NT), Primary 11B83, Secondary 11D09, 11D25
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
