Prime powers dividing products of consecutive integer values of x2n+1
Abstract
Let n be a positive integer and f(x) := x2n+1. In this paper, we study orders of primes dividing products of the form Pm,n:=f(1)f(2)·s f(m). We prove that if m > \1012,4n+1\, then there exists a prime divisor p of Pm,n such that ordp(Pm,n )≤ n· 2n-1. For n=2, we establish that for every positive integer m, there exists a prime divisor p of Pm,2 such that ordp (Pm,2) ≤ 4. Consequently, Pm,2 is never a fifth or higher power. This extends work of Cilleruelo who studied the case n=1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.