On numbers with a unique representation by a binary quadratic form
Consider a recurrence sequence of integers satisfying , where are fixed and a₀ ∈ -1,1. Assume that for all sufficiently large k. If there exists k₀∈ ℤ such that then for each negative integer -D there exist infinitely many rational primes q such that for some k ∈ ℕ and (-D/q) = -1.
The product of consecutive integers cannot be a power (after Erdős and Selfridge), but products of disjoint blocks of consecutive integers can be powers. Even if the blocks have a fixed length l ≥ 4 there are many solutions. We give the bound for the smallest solution and an estimate for the number of solutions below x.
What should be assumed about the integral polynomials in order that the solvability of the congruence for sufficiently large primes p implies the solvability of the equation in integers x? We provide some explicit characterizations for the cases when are binomials or have cyclic splitting fields.
-
-
Page 1