English

On the least common multiple of shifted powers

Number Theory 2021-03-16 v1 Probability

Abstract

Let a2a \geq 2 be an integer. We prove that for every periodic sequence (sn)n1(s_n)_{n \geq 1} in {1,+1}\{-1, +1\} there exists an effectively computable rational number Cs>0C_\mathbf{s} > 0 such that \begin{equation*} \log\operatorname{lcm}(a + s_1, a^2 + s_2, \dots, a^n + s_n) \sim C_\mathbf{s} \cdot \frac{\log a}{\pi^2} \cdot n^2 , \end{equation*} as n+n \to +\infty, where lcm\operatorname{lcm} denotes the least common multiple. Furthermore, we show that if (sn)n1(s_n)_{n \geq 1} is a sequence of independent and uniformly distributed random variables in {1,+1}\{-1, +1\} then \begin{equation*} \log\operatorname{lcm}(a + s_1, a^2 + s_2, \dots, a^n + s_n) \sim 6 \operatorname{Li}_2\!\big(\tfrac1{2}\big) \cdot \frac{\log a}{\pi^2} \cdot n^2 , \end{equation*} with probability 1o(1)1 - o(1), as n+n \to +\infty, where Li2\operatorname{Li}_2 is the dilogarithm function.

Keywords

Cite

@article{arxiv.2103.07967,
  title  = {On the least common multiple of shifted powers},
  author = {Carlo Sanna},
  journal= {arXiv preprint arXiv:2103.07967},
  year   = {2021}
}