Partitioning the positive integers with higher order recurrences.
In this article we compute the th power values of the quadratic polynomials with negative squarefree discriminant such that is coprime to the class number of the splitting field of over . The theory of unique factorisation and that of primitive divisors of integer sequences is used to deduce a bound on the values of which is small enough to allow the remaining cases to be easily checked. The results are used to determine all perfect power terms of certain polynomially generated integer...
Let be a linear integer recurrent sequence of order , and define as the set of primes that divide at least one term of . We give a heuristic approach to the problem whether has a natural density, and prove that part of our heuristics is correct. Under the assumption of a generalization of Artin’s primitive root conjecture, we find that has positive lower density for “generic” sequences . Some numerical examples are included.
Let and are conjugate complex algebraic integers which generate Lucas or Lehmer sequences. We present an algorithm to search for elements of such sequences which have no primitive divisors. We use this algorithm to prove that for all and with h, the -th element of these sequences has a primitive divisor for . In the course of proving this result, we give an improvement of a result of Stewart concerning more general sequences.