2000 character limit reached
Three consecutive near-square squarefree numbers
Published 14 Nov 2022 in math.NT | (2211.07237v3)
Abstract: In this note, we prove by using T. Estermann's and S. Dimitrov's arguments with an elementary inequality that there are infinitely many $n$ for which all of the numbers $n2+1,n2+2$ and $n2+3$ are squarefree. We also improve the error term slightly in the case of two consecutive numbers of the same form, so that we are able to prove the following asymptotic formula. \begin{align*} \sum_{n\le X}\mu2(n2+1)\mu2(n2+2)\mu2(n2+3)\sim\dfrac{7}{18}\prod_{p>3}\left(1-\dfrac{3+\left(\frac{-1}{p}\right)+\left(\frac{-2}{p}\right)+\left(\frac{-3}{p}\right)}{p2}\right)X. \end{align*}
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.