Groups and FieldsSuperchallengeCosets and Lagrange's Theorem ShareCosets and Lagrange's Theorem · Superchallenge problemFind the smallest positive integer nnn such that 2n≡1(mod1001)2^n \equiv 1 \pmod{1001}2n≡1(mod1001), where 1001=7⋅11⋅131001=7\cdot11\cdot131001=7⋅11⋅13.Check Show answer Walk through it step by step Practice more like this Review this concept