Perfect numbers and Fibonacci primes

preprint2014arXivOpen access

Abstract

In this paper, we introduce the concept of FF-perfect number, which is a positive integer nn such that ∑d∣n,d<nd2=3n\sum_{d|n,d<n}d^2=3n. We prove that all the FF-perfect numbers are of the form n=F2k−1F2k+1n=F_{2k-1}F_{2k+1}, where both F2k−1F_{2k-1} and F2k+1F_{2k+1} are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.