PutnamSuperchallengeIntegrals I: Feynman's Trick ShareIntegrals I: Feynman's Trick · Superchallenge problemFind the smallest positive integer nnn such that 2n≡1(mod125)2^n \equiv 1 \pmod{125}2n≡1(mod125).Check Show answer Walk through it step by step Practice more like this Review this concept