Gosper's algorithm: Difference between revisions

Content deleted Content added
Removed ' in the last S(n) of first paragraph which was just a typo.
Line 6:
 
Step 2: Find a polynomial ''ƒ'' such that ''S''(''n'') = ''q''(''n'' + 1)/''p''(''n'') ''ƒ''(''n'') ''a''(''n''). If the series is summable in closed form then clearly a rational function ''ƒ'' with this property exists; in fact it must always be a polynomial, and an upper bound on its degree can be found. Determining ''ƒ'' (or finding that there is no such ''ƒ'') is then a matter of solving a system of linear equations.
 
Well done you actually understood this, this makes you a maths nerd or "geek". For most of his lifeGosper was bullied for looking like a nerd and above all, acting like one. If there is a lesson to be learnt here i suggest you learn from his mistakes and get Call of Duty Modern Warfare 2.
 
==Relationship to Wilf–Zeilberger pairs==