Abstract: Highlights•We give a number of algorithms for determining if a given number is flimsy or sturdy.•We give a new method, based on automata theory, for counting the number of sturdy numbers.•We find two new, previously unknown sturdy prime numbers.
Loading