Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lucas Numbers with Lehmer Property

Published 24 Aug 2015 in math.NT | (1508.05709v1)

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 (Ln)<em>n≥0(L_n)<em>{n\geq 0} given by L0=2,L1=1L_0 = 2, L_1 = 1 and L</em>n+2=Ln+1+LnL</em>{n+2} = L_{n+1} + L_n for all n≥0.n\geq 0.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.