Usuario: guest
No has iniciado sesión
No has iniciado sesión
Type: Article
Perfect repdigits
Abstract:
Here, we give an algorithm to detect all perfect repdigits in any base g > 1. As an application, we find all such examples when g is an element of [2, ..., 333], extending a calculation from [2]. In particular, we demonstrate that there are no odd perfect repdigits for this range of bases.
Here, we give an algorithm to detect all perfect repdigits in any base g > 1. As an application, we find all such examples when g is an element of [2, ..., 333], extending a calculation from [2]. In particular, we demonstrate that there are no odd perfect repdigits for this range of bases.
Keywords: Plus:LEHMER-NUMBERS; DIVISORS
Journal: Mathematics of Computation
ISSN: 1088-6842
Year: 2013
Volume: 82
Number: 284
Pages: 2439–2459



Autores Institucionales Asociados a la Referencia: