On the Skolem Problem and Prime Powers
Abstract
The Skolem Problem asks, given a linear recurrence sequence (un), whether there exists n∈N such that un=0. In this paper we consider the following specialisation of the problem: given in addition c∈N, determine whether there exists n∈N of the form n=lpk, with k,l≤ c and p any prime number, such that un=0.
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.