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 given by and for all
Paper Prompts
Sign up for free to create and run prompts on this paper.