The least common multiple of consecutive quadratic progression terms

来源 :第六届全国组合数学与图论大会 | 被引量 : 0次 | 上传用户:baoyw00
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
Let k be an arbitrary given positive integer and let f(x) ∈ Z[x] be a quadratic polynomial with D as its discriminant and a as the coefficient of its quadratic term.Associated to the least common multiple lcm0≤i≤k{f(n + i)} of any k + 1 consecutive terms in the quadratic progression {f(n)}n∈N*, we define the function gkj(n) :=(Πk=0 |f(n +i)|)/lcm0≤i≤k{f(n + i)} for all positive integers n ∈ N* Zk,f, where Zkj :=Uki=0{n ∈N* : f(n + i) =0}.Let Kf :={j ∈ N* : D ≠ a2i2 for all integers i with 1 ≤ i ≤ j}.
其他文献
会议
会议
会议
会议
本文从做好青年工作对混合所有制企业党建和推进混合所有制企业高质量发展的时代内涵和重要性入手,以南国置业股份公司为例,以泛悦城项目突击队为着眼点,分析其现状与不足,提
Y.Egawa showed that any contraction critical k-connected graph has a fragment of cardinality at most k/4.Thus, for 4 ≤ k ≤ 7, the minimum degree of contractio
会议
In this paper, we present some properties of new generalized array type polynomials and the generalized Hermite-based Apostol-Bernoulli polynomial containing pa
会议
On basis of two definitions that 1.an induced subgraph by a vertex vi ∈ G and its neighbors in G is defined a vertex adjacent closed subgraph, and denoted by Q
会议
The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph.It found considerable applicati
会议