English

Nontrivial effective lower bounds for the least common multiple of a $q$-arithmetic progression

Number Theory 2020-08-25 v1

Abstract

This paper is devoted to establish nontrivial effective lower bounds for the least common multiple of consecutive terms of a sequence (un)nN{(u_n)}_{n \in \mathbb{N}} whose general term has the form un=r[n]q+u0u_n = r {[n]}_q + u_0, where q,rq , r are positive integers and u0u_0 is a non-negative integer such that gcd(u0,r)=gcd(u1,q)=1\mathrm{gcd}(u_0 , r) = \mathrm{gcd}(u_1 , q) = 1. For such a sequence, we show that for all positive integer nn, we have lcm{u1,u2,,un}c1c2nqn24\mathrm{lcm}\{u_1 , u_2 , \dots , u_n\} \geq c_1 \cdot c_2^n \cdot q^{\frac{n^2}{4}}, where c1c_1 and c2c_2 are positive constants depending only on q,rq , r and u0u_0. This can be considered as a qq-analog of the lower bounds already obtained by the author (in 2005) and by Hong and Feng (in 2006) for the arithmetic progressions.

Keywords

Cite

@article{arxiv.2008.10294,
  title  = {Nontrivial effective lower bounds for the least common multiple of a $q$-arithmetic progression},
  author = {Bakir Farhi},
  journal= {arXiv preprint arXiv:2008.10294},
  year   = {2020}
}

Comments

15 pages