pith. sign in

arxiv: 1508.05709 · v1 · pith:EVONTI2Onew · submitted 2015-08-24 · 🧮 math.NT

Lucas Numbers with Lehmer Property

classification 🧮 math.NT
keywords lehmernumbersequencefibonaccilucasprovedthereadapt
0
0 comments X
read the original abstract

A composite positive integer n is Lehmer if \phi(n) divides n-1, where \phi(n) is the Euler's totient function. No Lehmer number is known, nor has it been proved that they don't exist. In 2007, the second author [7] proved that there is no Lehmer number in the Fibonacci sequence. In this paper, we adapt the method from [7] to show that there is no Lehmer number in the companion Lucas sequence of the Fibonacci sequence $(L_n)_{n\geq 0}$ given by $L_0 = 2, L_1 = 1$ and $L_{n+2} = L_{n+1} + L_n$ for all $n\geq 0.$

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.