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

P. Erdos, Zhenxiang Zhang

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

A sequence A = {ai} of positive integers a1 < a2 < ... is said to be primitive if no term of A divides any other. A sequence A = {ai} of positive integers a1 < a2 < ... is said to be quasi-primitive if equation (ai, aj) = ar is not solvable with r < i < j. In our previous paper, we proved that Σ1 (ailogai) < 1.84 for any primitive sequence A. Analogically, in this paper, we prove that Σ1 (ailogai) < 2.77 for any quasi-primitive sequence A.

Original languageEnglish
Pages (from-to)1-5
Number of pages5
JournalComputers and Mathematics with Applications
Volume26
Issue number3
DOIs
Publication statusPublished - Aug 1993

    Fingerprint

Keywords

  • Primitive sequences
  • Quasi-primitive sequences

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this