φ(Fn ) = Fm

DOI10.1515/INTEG.2009.031zbMath1245.11022OpenAlexW2575368396MaRDI QIDQ3182871

Florin Nicolae, Florian Luca

Publication date: 16 October 2009

Published in: Integers (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/INTEGERS/papers/j30/j30.pdf

zbMATH Keywords

sieve methodFibonacci numbersEuler function

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Arithmetic functions; related numbers; inversion formulas (11A25) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (3)

Some arithmetic functions of factorials in Lucas sequences ⋮ Even perfect numbers in generalized Pell sequences ⋮ The Euler totient function on Lucas sequences

This page was built for publication: φ(Fn ) = Fm