The MHS algebra and supercongruences
classification
🧮 math.NT
keywords
supercongruencestechniquefindingnumbersprovingalgebraalgorithmicallyapply
read the original abstract
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain generalizations of the harmonic numbers. We apply the technique to derive many new supercongruences. We also provide software for finding and proving supercongruences using our technique.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.