article Open access

An upper bound for Erdösreciprocal sum of the sum-free sequence

  • Scientia Sinica Mathematica
  • Science China Press
Research footprint

At a glance

Citations
0
References
0
Comments
0
Paper overview

Abstract

Let A={<italic>a</italic><sub>1</sub>, <italic>a</italic><sub>1</sub>,…} be a strictly increasing sequence of positive integers. <italic>A</italic> is called a sum-free sequence if no <italic>a</italic><sub>i</sub> is the sum of two or more distinct earlier terms. By improving the properties of sum-free sequence, we de ne three types of new sequences, i.e., <italic>κ</italic><sub>1</sub> sequence, <italic>κ</italic><sub>21</sub> sequence and <italic>κ</italic><sub>22</sub> sequence. With the aid of <italic>κ</italic><sub>1</sub>; <italic>κ</italic><sub>21</sub>; <italic>κ</italic><sub>22</sub> sequences, by using the ideas of Erdös, Levine and O'Sullivan, and the idea and method of Chen, we improve the upper bounds of Erdösreciprocal sum constants. Let <italic>ρ</italic>(<italic>A</italic>)=Σ<sub><italic>k</italic>=1</sub><sup>∞</sup> 1/<italic>a</italic><sub><italic>k</italic></sub>. We improve the upper bound of <italic>ρ</italic>(<italic>A</italic>) to 2.86 or less, and prove that <italic>ρ</italic>(<italic>A</italic>)&lt; 2.8570.

Record transparency

Publication details

DOI
10.1360/n012014-00121
OpenAlex
W2326655908
Document type
article
Language
EN
Source
Scientia Sinica Mathematica
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.