On additive complements in the complement of a set of natural numbers

preprint2024arXivOpen access

Abstract

Let AA be a set of natural numbers. A set BB, a set of natural numbers, is an additive complement of the set AA if all sufficiently large natural numbers can be represented in the form x+yx+y, where x∈Ax\in A and y∈By\in B. Erdős proposed a conjecture that every infinite set of natural numbers has a sparse additive complement, and in 1954, Lorentz proved this conjecture. This article describes the existence or non-existence of those additive complements of the set AA that is a subset of the complement of AA. We provide a ratio test to verify the existence of such additive complements. In precise, we prove that if A={ai:i∈N}A=\{a_i: i\in \mathbb{N}\} is a set of natural numbers such that ai<ai+1a_i<a_{i+1} for i∈Ni \in \mathbb{N} and lim inf⁡n→∞(an+1/an)>1\liminf_{n\rightarrow \infty } (a_{n+1}/a_{n})>1, then there exists a set B⊂N∖AB\subset \mathbb{N}\setminus A such that BB is a sparse additive complement of the set AA.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.