Computational fun with sturdy and flimsy numbers

DOI10.4230/LIPICS.FUN.2021.10MaRDI QIDQ6487577zbMATH OpenFDO

Authors Trevor Clokie, Thomas Lidbetter, Jeffrey Shallit, Leon Witzman

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.FUN.2021.10

zbMATH Keywords

context-free grammarenumerationfinite automatonflimsy numbersturdy number

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• The existence of \(n\)-flimsy numbers in a given base
• Integer complexity: algorithms and computational results
• Widely digitally stable numbers
• On the digital representation of smooth numbers
• Sums of digits and almost primes

Cited in

(2)

• The existence of \(n\)-flimsy numbers in a given base
• Computational aspects of sturdy and flimsy numbers

This page was built for publication: Computational fun with sturdy and flimsy numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487577)