Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the least common multiple of shifted powers (2103.07967v1)

Published 14 Mar 2021 in math.NT and math.PR

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

Summary

We haven't generated a summary for this paper yet.