On the number of finite additive 2-bases
arXiv:2605.194492.61 citations
AI Analysis
For mathematicians studying additive bases, this offers a simpler proof of an established result, but it is incremental.
The paper provides a direct, short proof that the number of finite additive 2-bases grows exponentially, using elementary probabilistic arguments instead of complex analytic techniques.
The number of finite additive 2-bases is known to grow exponentially. While this fact has been established by Marzuola and Miller (2010) using complex analytic techniques embedded in the study of numerical sets, we provide a direct, short proof using elementary probabilistic arguments.