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} = 2 n(1+o(1)) for almost all subsets A ⊂ {1, . . . , n}.

No abstract

We study the logarithm of the least common multiple of the sequence of integers given by 1 2 + 1, 2 2 + 1, . . . , n 2 + 1. Using a result of Homma [4] on the distribution of roots of quadratic polynomials modulo primes we calculate the error term for the asymptotics obtained by Cilleruelo [2].

No abstract