Lucas Numbers with Lehmer Property

preprint2015arXivOpen access

Abstract

A composite positive integer n is Lehmer if ϕ(n) divides n-1, where ϕ(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 (Ln)n≥0(L_n)_{n\geq 0} given by L0=2,L1=1L_0 = 2, L_1 = 1 and Ln+2=Ln+1+LnL_{n+2} = L_{n+1} + L_n for all n≥0.n\geq 0.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.