# Computational Aspects of Sturdy and Flimsy Numbers

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy numbers. We provide some criteria for determining whether a number is sturdy. Focusing on the case of base b = 2, we study the computational problem of checking whether a given number is sturdy, giving several algorithms for the problem. We find two additional, previously unknown sturdy primes. We develop a method for determining which numbers with a fixed number of 0's in binary are flimsy. Finally, we develop a method that allows us to estimate the number of k-flimsy numbers with n bits, and we provide explicit results for k = 3 and k = 5. Our results demonstrate the utility (and fun) of creating algorithms for number theory problems, based on methods of automata theory.

• 2 publications
• 1 publication
• 3 publications
• 53 publications
• 1 publication
research
04/14/2023

### On representations of real numbers and the computational complexity of converting between such representations

We study the computational complexity of converting one representation o...
research
07/14/2020

### The Collatz process embeds a base conversion algorithm

The Collatz process is defined on natural numbers by iterating the map T...
research
03/20/2018

### Eleven Simple Algorithms to Compute Fibonacci Numbers

The Fibonacci numbers are a sequence of integers in which every number a...
research
03/20/2018

### Twelve Simple Algorithms to Compute Fibonacci Numbers

The Fibonacci numbers are a sequence of integers in which every number a...
research
01/16/2019

### The notion of "Unimaginable Numbers" in computational number theory

Literature considers under the name unimaginable numbers any positive in...
research
11/30/2015

### Multi-Number CVT-XOR Arithmetic Operations in any Base System and its Significant Properties

Carry Value Transformation (CVT) is a model of discrete dynamical system...
research
07/27/2018

### Enumerating Cryptarithms Using Deterministic Finite Automata

A cryptarithm is a mathematical puzzle where given an arithmetic equatio...