pith. sign in

arxiv: 1112.3013 · v2 · pith:HACBHJSFnew · submitted 2011-12-13 · 🧮 math.NT

The least common multiple of random sets of positive integers

classification 🧮 math.NT
keywords subsetcommondotsleastmultiplerandomalmostbehavior
0
0 comments X
read the original abstract

We study the typical behavior of the least common multiple of the elements of a random subset $A\subset \{1,\dots, n\}$. For example we prove that $\text{lcm}\{a:\ a\in A\}=2^{n(1+o(1))}$ for almost all subsets $A\subset\{1,\dots,n\}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.