Zeroless arithmetic: representing integers ONLY using ONE

DOI10.1080/10236198.2013.791288zbMath1280.39001arXiv1303.0885OpenAlexW2060366758MaRDI QIDQ2868945

Doron Zeilberger, Edinah K. Gnang

Publication date: 27 December 2013

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0885

zbMATH Keywords

algorithmenumerationrandom generationdynamical programmingarithmetical formulasreverse Polish notation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Dynamic programming (90C39) Random number generation in numerical analysis (65C10) General theory of difference equations (39A05) Numerical aspects of recurrence relations (65Q30)

Related Items (2)

Counting arithmetic formulas ⋮ On the number of arithmetic formulas

Uses Software

• OEIS
• ArithFormulas

Cites Work

• Unnamed Item
• Unnamed Item

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