arXiv · 2404.01483
Creating Decidable Diophantine Equations
Abstract
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient polynomial $p(x, y, z)$ whose only integer roots are consecutive triples of Tribonacci numbers.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Robert Dougherty-Bliss, Charles Kenney, Doron Zeilberger. 2024-04-01. Creating Decidable Diophantine Equations. https://arxiv.org/abs/2404.01483
Cite the original work for its findings. Save a collection to share your selection of sources.