Equations Involving Arithmetic Functions of Fibonacci and Lucas Numbers

Abstract

For any positive integer k, let <f>(k) and a(k) be the number of positive integers less than or equal to k and relatively prime to k and the sum of divisors ofk, respectively. In [6] we have shown that 0(Fn) > F^n) and that a(Fn) < Fa{ri) and we have also determined all the cases in which the above inequalities become equalities. A more general inequality… (More)

Topics

Cite this paper

@inproceedings{Luca1998EquationsIA, title={Equations Involving Arithmetic Functions of Fibonacci and Lucas Numbers}, author={Florian Luca}, year={1998} }