On the composite Lehmer numbers with prime indices, I

2017 ◽  
Vol 9 (1) ◽  
Author(s):  
A. Schinzel
Keyword(s):  
Lehmer Numbers

scholarly journals On some arithmetical properties of Lucas and Lehmer numbers

1982 ◽  
Vol 40 (4) ◽  
pp. 369-373 ◽  
Author(s):  
Kalman Győry
Keyword(s):  
Lehmer Numbers

scholarly journals On primitive prime factors of Lehmer numbers II

1963 ◽  
Vol 8 (2) ◽  
pp. 251-257 ◽  
Author(s):  
Andrzej Schinzel
Keyword(s):  
Prime Factors ◽  
Lehmer Numbers

The Intrinsic Divisors of Lehmer Numbers

1955 ◽  
Vol 62 (2) ◽  
pp. 230 ◽  
Author(s):  
Morgan Ward
Keyword(s):  
Lehmer Numbers

On k-Lehmer Numbers

Integers ◽  
2012 ◽  
Vol 12 (5) ◽  
Author(s):  
José María Grau ◽  
Antonio M. Oller-Marcén
Keyword(s):  
Lehmer Numbers ◽  
Positive Integers

Abstract.Lehmer's totient problem consists of determining the set of positive integers

scholarly journals On divisors of Lucas and Lehmer numbers

2013 ◽  
Vol 211 (2) ◽  
pp. 291-314 ◽  
Author(s):  
Cameron L. Stewart
Keyword(s):  
Lehmer Numbers

scholarly journals Repunit Lehmer numbers

2010 ◽  
Vol 54 (1) ◽  
pp. 55-65 ◽  
Author(s):  
Javier Cilleruelo ◽  
Florian Luca
Keyword(s):  
Positive Integer ◽  
Lehmer Numbers

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].

Sign in / Sign up

Export Citation Format

Share Document