Abstract
We present a derivation of Gosper's algorithm which permits generalization to higher-order recurrences with constant least and most significant coefficients. Like Gosper's algorithm, the generalized algorithm requires only ‘rationalrs operations (such as gcd and resultant computations) but no factorization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
