Skip to main content
Article thumbnail
Location of Repository

On the Euler Function of Fibonacci Numbers

By Florian Luca, V. Janitzio Mejía Huguet and Florin Nicolae


In this paper, we show that for any positive integer k, the set φ(Fn+1) φ(Fn+2) φ(Fn+k), ,..., : n ≥ 1 φ(Fn) φ(Fn) φ(Fn) is dense in R k ≥0, where φ(m) is the Euler function of the positive integer m and Fn is the nth Fibonacci number

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.