### Abstract

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

Original language | English |
---|---|

Pages (from-to) | 1-5 |

Number of pages | 5 |

Journal | Computers and Mathematics with Applications |

Volume | 26 |

Issue number | 3 |

DOIs | |

Publication status | Published - Aug 1993 |

### Fingerprint

### Keywords

- Primitive sequences
- Quasi-primitive sequences

### ASJC Scopus subject areas

- Modelling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics