Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1156.11004
Hong, Shaofang; Feng, Weiduan
Lower bounds for the least common multiple of finite arithmetic progressions.
(English)
[J] C. R., Math., Acad. Sci. Paris 343, No. 11-12, 695-698 (2006). ISSN 1631-073X

Summary: Let $u_0$, $r$ and $n$ be positive integers such that $(u_0,r)=1.$ Let $u_k=u_0+kr$ for $1\leq k\leq n$. We prove that $L_n:=\text{lcm}\{u_0,u_1,\dots, u_n\}\geq u_0(r+1)^n$ which confirms {\it B. Farhi}'s conjecture [C. R., Math., Acad. Sci. Paris 341, No. 8, 469--474 (2005; Zbl 1117.11005)]. Further we show that if $r<n$, then $L_n\geq u_0r(r+1)^n$.
MSC 2000:
*11A05 Multiplicative structure of the integers
11B25 Arithmetic progressions

Citations: Zbl 1117.11005

Cited in: Zbl 1157.11001

Highlights
Master Server