Abstract
We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence of rational numbers and a target , decide whether occurs in the sequence. We show decidability of this problem under the assumption that in the defining recurrence , the roots of the polynomials and are all rational numbers. Our proof relies on bounds on the density of primes in arithmetic progressions. We also observe a relationship between the decidability of the Membership problem (and variants) and the Rohrlich-Lang conjecture in transcendence theory.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.