91 citations · 520 across the 230 of their papers we have counts for
15 papers · 1 filter
Creating Decidable Diophantine Equations
Robert Dougherty-Bliss, Charles Kenney, Doron Zeilberger
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences…
Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes
Robert Dougherty-Bliss, Doron Zeilberger
We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the c…
Exploring General Apéry Limits via the Zudilin-Straub t-transform
Robert Dougherty-Bliss, Doron Zeilberger
Inspired by a recent beautiful construction of Armin Straub and Wadim Zudilin, that 'tweaked' the sum of the powers of the -th row of Pascal's triangle, getting instead…
Human and automated approaches for finite trigonometric sums
Jean-Paul Allouche, Doron Zeilberger
We show that identities involving trigonometric sums recently proved by Harshitha, Vasuki and Yathirajsharma, using Ramanujan's theory of theta functions, were either already in th…
Automating John P. D'Angelo's method to study Complete Polynomial Sequences
Shalosh B. Ekhad, Doron Zeilberger
In this article, dedicated to the memory of Ron Graham, we fully automate John P. D'Angelo's method for studying complete polynomial sequences, for which Ron Graham, back in 1964,…
Experimenting with Apery Limits and WZ pairs
Robert Dougherty-Bliss, Doron Zeilberger
This article, dedicated with admiration in memory of Jon and Peter Borwein, illustrates by example, the power of experimental mathematics, so dear to them both, by experimenting wi…