On a problem of Nathanson
Number Theory
2022-01-27 v1 Combinatorics
Abstract
A set of nonnegative integers is an asymptotic basis of order if every sufficiently large integer can be represented as the sum of integers (not necessarily distinct) of . An asymptotic basis of order is minimal if no proper subset of is an asymptotic basis of order . In this paper, we resolve a problem of Nathanson on minimal asymptotic bases of order .
Cite
@article{arxiv.1711.00174,
title = {On a problem of Nathanson},
author = {Yong-Gao Chen and Min Tang},
journal= {arXiv preprint arXiv:1711.00174},
year = {2022}
}
Comments
8 pages