Now showing items 1-1 of 1

    • Counting Flimsy Numbers via Formal Language Theory 

      Clokie, Trevor (University of Waterloo, 2021-02-02)
      Let s_2(n) be the sum of the digits of n when expressed in base 2. For integers n and k, Stolarsky defined n to be k-flimsy if s_2(kn) < s_2(n). In this paper, we generalize the definition of k-flimsy numbers to all bases ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages