𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by P. Erdős; Zhenxiang Zhang

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
265 KB
Volume
26
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

An upper bound of Σ 1(ai log ai) for qua
An upper bound of Σ 1(ai log ai) for quasi-primitive sequences
✍ D.A. Clark 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 347 KB

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.