English

On the least common multiple of several random integers

Probability 2019-11-11 v2 Number Theory

Abstract

Let Ln(k)L_n(k) denote the least common multiple of kk independent random integers uniformly chosen in {1,2,,n}\{1,2,\ldots ,n\}. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as nn\to\infty of f(Ln(k))nrk\frac{f(L_n(k))}{n^{rk}} for a wide class of multiplicative arithmetic functions~ff with polynomial growth r>1r>-1. Furthermore, we identify the limit as an infinite product of independent random variables indexed by prime numbers. Along the way, we compute the generating function of a trimmed sum of independent geometric laws, occurring in the above infinite product. This generating function is rational; we relate it to the generating function of a certain max-type Diophantine equation, of which we solve a generalized version. Our results extend theorems by Erd\H{o}s and Wintner (1939), Fern\'{a}ndez and Fern\'{a}ndez (2013) and Hilberdink and T\'{o}th (2016).

Keywords

Cite

@article{arxiv.1901.03002,
  title  = {On the least common multiple of several random integers},
  author = {Alin Bostan and Alexander Marynych and Kilian Raschel},
  journal= {arXiv preprint arXiv:1901.03002},
  year   = {2019}
}

Comments

19 pages

R2 v1 2026-06-23T07:07:41.770Z