On the least common multiple of several random integers

Abstract

Let Ln(k) denote the least common multiple of k independent random integers uniformly chosen in \1,2,… ,n\. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as n∞ of f(Ln(k))nrk for a wide class of multiplicative arithmetic functions~f with polynomial growth r>-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 Erdos and Wintner (1939), Fern\'andez and Fern\'andez (2013) and Hilberdink and T\'oth (2016).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…