✦ LIBER ✦

An upper bound of Σ 1(ai log ai) for quasi-primitive sequences

✍ Scribed by D.A. Clark

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 347 KB
Volume: 35
Category: Article
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(97)00293-9

No coin nor oath required. For personal study only.

✦ Synopsis

A nonempty sequence A = {ad} of integers a1 < ap < . -a, which are greater than or equal to two, ia called qua&primitive if there do not exist three distinct integers e, aj,ak E A such that (pi, aj 1 = a& We ahow that c l/(~ log G) < 4.2022 for any quasi-primitive sequence.

📜 SIMILAR VOLUMES

Upper bound of Σ1(ailogai) for quasi-pri

Upper bound of Σ1(ailogai) for quasi-primitive sequences

✍ P. Erdős; Zhenxiang Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 265 KB

be quasi-primitive if equation (ai,uj) = a, is not solvable with T < i < j. In our previous paper, we proved that c l/(ai logai) < 1.84 for any primitive sequence A. Analogically, in this paper, we prove that c l/(ai log ai) < 2.77 for any quasi-primitive sequence A.