Zeroless arithmetic: representing integers ONLY using ONE

From MaRDI portal



Abstract: We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the inputs are ones. We also describe efficient algorithms for the random generation of such representations, and use Dynamical Programming to find a shortest possible formula representing any given positive integer.





Describes a project that uses

Uses Software






This page was built for publication: Zeroless arithmetic: representing integers ONLY using ONE

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