On the number of arithmetic formulas

DOI10.1142/S1793042115500591zbMath1364.05009OpenAlexW2102911826MaRDI QIDQ5253874

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

partitionsasymptotic formulasarithmetic expressions

Mathematics Subject Classification ID

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

Related Items (1)

Counting arithmetic formulas

Cites Work

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

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