The least common multiple of consecutive quadratic progression terms

preprint2014arXivOpen access

Abstract

Let kk be an arbitrary given positive integer and let f(x)∈Z[x]f(x)\in {\mathbb Z}[x] be a quadratic polynomial with aa and DD as its leading coefficient and discriminant, respectively. Associated to the least common multiple lcm0≤i≤k{f(n+i)}{\rm lcm}_{0\le i\le k}\{f(n+i)\} of any k+1k+1 consecutive terms in the quadratic progression {f(n)}n∈N∗\{f(n)\}_{n\in \mathbb{N}^*}, we define the function gk,f(n):=(∏i=0k∣f(n+i)∣)/lcm0≤i≤k{f(n+i)}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∈N∗∖Zk,fn\in \mathbb{N}^*\setminus Z_{k, f}, where Zk,f:=⋃i=0k{n∈N∗:f(n+i)=0}Z_{k,f}:=\bigcup_{i=0}^k\{n\in \mathbb{N}^*: f(n+i)=0\}. In this paper, we first show that gk,fg_{k,f} is eventually periodic if and only if D≠a2i2D\ne a^2i^2 for all integers ii with 1≤i≤k1\le i\le k. Consequently, we develop a detailed pp-adic analysis of gk,fg_{k, f} and determine its smallest period. Finally, we obtain asymptotic formulas of log⁡lcm0≤i≤k{f(n+i)}\log {\rm lcm}_{0\le i\le k}\{f(n+i)\} for all quadratic polynomials ff as nn goes to infinity.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.