Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Perfect repdigits

      Broughan, Kevin A.; Sanchez, Sergio Guzman; Luca, Florian
      DOI
       10.1090/S0025-5718-2013-02682-8
      Link
       www.ams.org
      Find in your library  
      Citation
      Export citation
      Broughan, K., Sanchez, S. G., & Luca, F. (2013). Perfect repdigits. Mathematics of Computation, 82, 2439-2459.
      Permanent Research Commons link: https://hdl.handle.net/10289/8003
      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.
      Date
      2013
      Type
      Journal Article
      Publisher
      American Mathematical Society
      Collections
      • Computing and Mathematical Sciences Papers [1455]
      Show full item record  

      Usage

       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement