On the least common multiple of shifted powers
Abstract
Let a ≥ 2 be an integer. We prove that for every periodic sequence (sn)n ≥ 1 in \-1, +1\ there exists an effectively computable rational number Cs > 0 such that equation* lcm(a + s1, a2 + s2, …, an + sn) Cs · aπ2 · n2 , equation* as n +∞, where lcm denotes the least common multiple. Furthermore, we show that if (sn)n ≥ 1 is a sequence of independent and uniformly distributed random variables in \-1, +1\ then equation* lcm(a + s1, a2 + s2, …, an + sn) 6 Li2\!(12) · aπ2 · n2 , equation* with probability 1 - o(1), as n +∞, where Li2 is the dilogarithm function.
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.