On the sum of reciprocals of least common multiples, II

Jianrong Zhao, Guoyou Qian and Wei Zhao

Applied Mathematics and Computation, 2021, vol. 399, issue C

Abstract: Let n and r be positive integers with r≥2 and let A={ai}i=1∞ be a strictly increasing sequence of positive integers. Let SA,r(n):=∑i=1n1lcm(ai,…,ai+r−1). In 1978, Borwein showed that SA,2(n)≤1−12n with the equality occurring if and only if ai=2i−1 for 1≤i≤n+1. In 2017, Qian proved that SA,r(n)≤Vr(n) for 3≤r≤7 and characterized the first n+r−1 terms of the sequence A such that SA,r(n)=Vr(n) holds, where Vr(n) depends only on r and n. In this paper, we further investigate SA,r(n) for 8≤r≤11 and we obtain the least upper bound Ur of SA,r(n) for all strictly increasing sequences A of positive integers and for all positive integers n, where Ur is a constant depending only on r.

Keywords: Least common multiple; Sequence; Upper bound (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321000515
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:399:y:2021:i:c:s0096300321000515

DOI: 10.1016/j.amc.2021.126003

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().