Perfect numbers and Fibonacci primes
Abstract
In this paper, we introduce the concept of F-perfect number, which is a positive integer n such that Σd|n,d<nd2=3n. We prove that all the F-perfect numbers are of the form n=F2k-1F2k+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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.