Abstract

We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence ⟨un⟩n=0∞\langle u_n \rangle_{n=0}^\infty of rational numbers and a target t∈Qt \in \mathbb{Q}, decide whether tt occurs in the sequence. We show decidability of this problem under the assumption that in the defining recurrence p(n)un=q(n)un−1p(n)u_{n}=q(n)u_{n-1}, the roots of the polynomials p(x)p(x) and q(x)q(x) 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.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.