The least common multiple of random sets of positive integers
Abstract
We study the typical behavior of the least common multiple of the elements of a random subset A⊂ \1,…, n\. For example we prove that lcm\a:\ a∈ A\=2n(1+o(1)) for almost all subsets A⊂\1,…,n\.
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.