Papers
Topics
Authors
Recent
Search
2000 character limit reached

The least common multiple of consecutive quadratic progression terms

Published 25 Aug 2012 in math.NT | (1208.5119v2)

Abstract: Let $k$ be an arbitrary given positive integer and let $f(x)\in {\mathbb Z}[x]$ be a quadratic polynomial with $a$ and $D$ as its leading coefficient and discriminant, respectively. Associated to the least common multiple ${\rm lcm}{0\le i\le k}{f(n+i)}$ of any $k+1$ consecutive terms in the quadratic progression ${f(n)}{n\in \mathbb{N}*}$, we define the function $g_{k, f}(n):=(\prod_{i=0}{k}|f(n+i)|)/{\rm lcm}{0\le i\le k}{f(n+i)}$ for all integers $n\in \mathbb{N}*\setminus Z{k, f}$, where $Z_{k,f}:=\bigcup_{i=0}k{n\in \mathbb{N}*: f(n+i)=0}$. In this paper, we first show that $g_{k,f}$ is eventually periodic if and only if $D\ne a2i2$ for all integers $i$ with $1\le i\le k$. Consequently, we develop a detailed $p$-adic analysis of $g_{k, f}$ and determine its smallest period. Finally, we obtain asymptotic formulas of $\log {\rm lcm}_{0\le i\le k}{f(n+i)}$ for all quadratic polynomials $f$ as $n$ goes to infinity.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.