On the number of arithmetic formulas

DOI10.1142/S1793042115500591MaRDI QIDQ5253874zbMATH OpenOpenAlexFDO

Authors Carlo Sanna

Publication date 5 June 2015

Published in International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793042115500591

zbMATH Keywords

arithmetic expressionsasymptotic formulaspartitions

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorial aspects of partitions of integers (05A17) Other number representations (11A67) Elementary number theory (11A99) Other combinatorial number theory (11B75) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Counting arithmetic formulas
• Zeroless arithmetic: representing integers ONLY using ONE
• scientific article; zbMATH DE number 3869413
• scientific article; zbMATH DE number 3872676
• The cost of computing integers

Cites work

• A Bound for the Number of Multiplicative Partitions
• On a problem of Oppenheim concerning Factorisatio Numerorum
• On the expansion of the partition functions in a series
• On the Number of Multiplicative Partitions
• Zeroless arithmetic: representing integers ONLY using ONE

Cited in

(4)

• Counting arithmetic formulas
• Zeroless arithmetic: representing integers ONLY using ONE
• scientific article; zbMATH DE number 3869413 (Why is no real title available?)
• Some integer formula encodings and related algorithms

This page was built for publication: On the number of arithmetic formulas

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