Uwe Stroinski
Published 2016-06-06Version 1
In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive prime divisors and representations of some related Euler products. Moreover, we sum functions over all primitive divisors of a Fibonacci number and obtain a non--trivial fixed point of this operation.
Comments: 22 pages, 1 figure
On a problem of Pillai with Fibonacci numbers and powers of $3$
On a problem of Pillai with Fibonacci numbers and powers of 2
A note on Fibonacci number of even index
![QR code for arXiv:1606.01715 [math.NT]](http://oss.arxitics.com/images/favicon.svg)