Abstract
AbstractA Lehmer number is a composite positive integer n such that ϕ(n)|n − 1. In this paper, we show that given a positive integer g > 1 there are at most finitely many Lehmer numbers which are repunits in base g and they are all effectively computable. Our method is effective and we illustrate it by showing that there is no such Lehmer number when g ∈ [2, 1000].
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
