On the Euler Function of Fibonacci Numbers

Abstract

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

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://www.math.uwaterloo.ca/J... (external link)