Prime powers dividing products of consecutive integer values of x^2ⁿ+1

DOI10.1007/S40993-019-0182-XMaRDI QIDQ2282164zbMATH OpenOpenAlexFDO

Authors Stephan Baier, Pallab Kanti Dey

Publication date 7 January 2020

Published in Research in Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.13003

zbMATH Keywords

congruencescyclotomic fieldspolynomials

Mathematics Subject Classification ID

Primes (11A41) Special sequences and polynomials (11B83) Polynomials in number theory (11C08)

Abstract: Let $n$ be a positive integer and $f(x):=x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)cdotsf(m)$. We prove that if $m>max10^{12},4^{n+1}$, then there exists a prime divisor $p$ of $P_{m,n}$ such that ord${}_p(P_{m,n})leqncdot{2}^{n-1}$. For $n=2$, we establish that for every positive integer $m$, there exists a prime divisor $p$ of $P_{m,2}$ such that ord${}_p(P_{m,2})leq4$. Consequently, $P_{m,2}$ is never a fifth or higher power. This extends work of Cilleruelo who studied the case $n=1$.

Review text

\textit{J. Cilleruelo} [J. Number Theory 128, No. 8, 2488--2491 (2008; Zbl 1213.11057)] proved that if \(m>3\) is an integer then there exists a prime number \(p\) dividing \(A(m)=(1^2+1)(2^2+1)\cdots (m^2+1)\) such that \(p^2\nmid A(m)\). Consequently, \(A(m)\) is a perfect power only for \(m=3\) for which \(A(3)=10^2\). Since then this result was generalized by several authors. The paper under review proposes such a generalization with the factor \(x^2+1\) replaced \(x^{2^n}+1\) for some fixed integer \(n\ge 1\). Setting \(P_{m,n}=(1^{2^n}+1)(2^{2^n}+1)\cdots (m^{2^n}+1)\), the authors prove that if \(n\ge 2\) and \(m>\max\{10^{12}, 4^{n+1}\}\), then \(P_{m,n}\) has a prime factor \(p\) which appears with exponent at most \(n2^{n-1}\) in the factorization of \(P_{m,n}\). When \(n=2\), they are able to remove the condition that \(m> 10^{12}\) concluding that \(P_{m,2}\) is never a perfect power \(y^q\) of some integer \(y\) of exponent \(q\ge 5\). The proofs use sieve methods (explicit estimates for the number of primes in arithmetic progressions up to some upper bound), as well as arithmetic considerations in the cyclotomic field \({\mathbb Q}(e^{2\pi i/2^{n+1}})\).

Recommendations

• scientific article; zbMATH DE number 3557873
• On some properties of the Euler's factor of certain odd perfect numbers
• scientific article; zbMATH DE number 3989433
• scientific article; zbMATH DE number 3304122
• 65.1 Even perfect numbers
• Sur la proximité des nombres puissants
• On Primes p with σ(p α ) = m 2
• On the 2r-perfect numbers
• scientific article; zbMATH DE number 3963915
• On the index of an odd perfect number

Cites work

• A note on the products \((1^\mu +1)(2^\mu +1)\dots (n^\mu +1)\)
• Diophantine equations with products of consecutive values of a quadratic polynomial
• Explicit bounds for primes in arithmetic progressions
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• Neither (4k 2 + 1) nor (2k(k – 1) + 1) is a Perfect Square
• On the products \((1^\ell + 1)(2^\ell + 1)\cdots(n^\ell + 1)\). II
• On the products \((1^\ell +1)(2^\ell +1)\cdots (n^\ell +1)\)
• Powerful numbers in (1ᵏ +1)(2ᵏ+1) (n^k +1)
• Powerful numbers in the product of consecutive integer values of a polynomial
• Squares in \((1^2+1)\dots(n^2+1)\)
• The large sieve
• The 𝑘^{𝑡ℎ} prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2

Cited in

(3)

• On Prime Factors of A n - 1
• On the prime decomposition of integers of the form \(\frac{z^n-y^n}{z-y}\)
• Zero sums amongst roots and Cilleruelo's conjecture on the LCM of polynomial sequences

This page was built for publication: Prime powers dividing products of consecutive integer values of \(x^{2^n}+1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282164)