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∈ [2, … ,333], extending a calculation from [2]. In particular, we demonstrate that there are no odd perfect repdigits for this range of bases.
Type
Journal Article
Type of thesis
Series
Citation
Broughan, K., Sanchez, S. G., & Luca, F. (2013). Perfect repdigits. Mathematics of Computation, 82, 2439-2459.
Date
2013
Publisher
American Mathematical Society
Degree
Supervisors
Rights