2000 character limit reached
Extension of a conjectural supercongruence of (G.3) of Swisher using Zeilberger's algorithm
Published 5 Nov 2020 in math.NT | (2011.02757v2)
Abstract: Using Zeilberger's algorithm, we here give a proof of the supercongruence for any odd integer $r>3$. This extends the third conjectural supercongruence of (G.3) of Swisher to modulo higher prime powers than that expected by Swisher.
Paper Prompts
Sign up for free to create and run prompts on this paper.