Perfect numbers and Fibonacci primes (III)

Publication date 19 September 2017

Abstract: In this article, we consider the Diophantine equation

s i g m a_{2} (n) - n^{2} = A n + B

with

A = P^{2} p m 2

. For some

B

, we show that except for finitely many computable solutions in the range

n l e q (| A | + | B |)^{3}

, all the solutions are expressible in terms of Lucas sequences. Meanwhile, we obtain some results relating to other linear recurrent sequences.

This page was built for publication: Perfect numbers and Fibonacci primes (III)