  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.
